./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:11:54,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:11:54,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:11:54,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:11:54,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:11:54,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:11:54,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:11:54,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:11:54,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:11:54,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:11:54,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:11:54,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:11:54,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:11:54,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:11:54,993 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:11:54,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:11:54,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:11:54,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:11:54,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:11:54,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:11:54,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:11:54,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:11:54,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:11:54,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:11:54,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:11:54,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:11:55,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:11:55,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:11:55,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:11:55,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:11:55,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:11:55,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:11:55,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:11:55,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:11:55,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:11:55,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:11:55,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:11:55,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:11:55,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:11:55,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:11:55,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:11:55,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:11:55,003 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb [2024-10-11 03:11:55,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:11:55,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:11:55,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:11:55,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:11:55,210 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:11:55,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c [2024-10-11 03:11:56,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:11:56,561 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:11:56,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c [2024-10-11 03:11:56,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/006355227/65778695db9e4826994ed251816f9e27/FLAG94ff637c9 [2024-10-11 03:11:56,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/006355227/65778695db9e4826994ed251816f9e27 [2024-10-11 03:11:56,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:11:56,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:11:56,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:11:56,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:11:56,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:11:56,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:11:56" (1/1) ... [2024-10-11 03:11:56,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1113b4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:56, skipping insertion in model container [2024-10-11 03:11:56,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:11:56" (1/1) ... [2024-10-11 03:11:57,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:11:57,143 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c[635,648] [2024-10-11 03:11:57,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:11:57,212 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:11:57,223 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c[635,648] [2024-10-11 03:11:57,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:11:57,265 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:11:57,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57 WrapperNode [2024-10-11 03:11:57,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:11:57,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:11:57,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:11:57,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:11:57,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,304 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 317 [2024-10-11 03:11:57,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:11:57,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:11:57,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:11:57,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:11:57,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,324 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:11:57,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:11:57,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:11:57,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:11:57,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:11:57,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (1/1) ... [2024-10-11 03:11:57,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:11:57,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:11:57,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:11:57,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:11:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:11:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2024-10-11 03:11:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2024-10-11 03:11:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 03:11:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 03:11:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:11:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:11:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:11:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:11:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:11:57,426 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:11:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:11:57,426 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:11:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:11:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:11:57,426 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:11:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:11:57,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:11:57,503 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:11:57,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:11:57,806 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-11 03:11:57,806 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:11:57,835 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:11:57,835 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 03:11:57,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:11:57 BoogieIcfgContainer [2024-10-11 03:11:57,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:11:57,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:11:57,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:11:57,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:11:57,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:11:56" (1/3) ... [2024-10-11 03:11:57,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2471dac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:11:57, skipping insertion in model container [2024-10-11 03:11:57,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:11:57" (2/3) ... [2024-10-11 03:11:57,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2471dac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:11:57, skipping insertion in model container [2024-10-11 03:11:57,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:11:57" (3/3) ... [2024-10-11 03:11:57,843 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu.cil.c [2024-10-11 03:11:57,877 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:11:57,877 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:11:57,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:11:57,947 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a4bed66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:11:57,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:11:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 96 states have (on average 1.5833333333333333) internal successors, (152), 100 states have internal predecessors, (152), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 03:11:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:11:57,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:11:57,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:11:57,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:11:57,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:11:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1531733126, now seen corresponding path program 1 times [2024-10-11 03:11:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:11:57,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038057258] [2024-10-11 03:11:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:11:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:11:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:11:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:11:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:11:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:11:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:11:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:11:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:11:58,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038057258] [2024-10-11 03:11:58,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038057258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:11:58,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:11:58,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:11:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27484317] [2024-10-11 03:11:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:11:58,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:11:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:11:58,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:11:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:11:58,241 INFO L87 Difference]: Start difference. First operand has 123 states, 96 states have (on average 1.5833333333333333) internal successors, (152), 100 states have internal predecessors, (152), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:11:58,432 INFO L93 Difference]: Finished difference Result 256 states and 398 transitions. [2024-10-11 03:11:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:11:58,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-11 03:11:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:11:58,442 INFO L225 Difference]: With dead ends: 256 [2024-10-11 03:11:58,442 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 03:11:58,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:11:58,450 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 208 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:11:58,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 262 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:11:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 03:11:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2024-10-11 03:11:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 97 states have internal predecessors, (140), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 03:11:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-10-11 03:11:58,491 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 52 [2024-10-11 03:11:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:11:58,491 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-10-11 03:11:58,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-10-11 03:11:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:11:58,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:11:58,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:11:58,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:11:58,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:11:58,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:11:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1884821508, now seen corresponding path program 1 times [2024-10-11 03:11:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:11:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700796829] [2024-10-11 03:11:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:11:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:11:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:11:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:11:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:11:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:11:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:11:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:11:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:11:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700796829] [2024-10-11 03:11:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700796829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:11:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:11:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:11:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092328482] [2024-10-11 03:11:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:11:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:11:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:11:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:11:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:11:58,645 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:11:58,965 INFO L93 Difference]: Finished difference Result 368 states and 542 transitions. [2024-10-11 03:11:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:11:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-11 03:11:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:11:58,970 INFO L225 Difference]: With dead ends: 368 [2024-10-11 03:11:58,970 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 03:11:58,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:11:58,972 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 370 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:11:58,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 730 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:11:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 03:11:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2024-10-11 03:11:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 182 states have internal predecessors, (263), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:11:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 318 transitions. [2024-10-11 03:11:59,026 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 318 transitions. Word has length 52 [2024-10-11 03:11:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:11:59,027 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 318 transitions. [2024-10-11 03:11:59,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 318 transitions. [2024-10-11 03:11:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:11:59,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:11:59,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:11:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:11:59,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:11:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:11:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1886825117, now seen corresponding path program 1 times [2024-10-11 03:11:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:11:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601466678] [2024-10-11 03:11:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:11:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:11:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:11:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:11:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:11:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:11:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:11:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:11:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:11:59,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601466678] [2024-10-11 03:11:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601466678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:11:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:11:59,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:11:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446999674] [2024-10-11 03:11:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:11:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:11:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:11:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:11:59,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:11:59,148 INFO L87 Difference]: Start difference. First operand 220 states and 318 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:11:59,304 INFO L93 Difference]: Finished difference Result 459 states and 676 transitions. [2024-10-11 03:11:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:11:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-11 03:11:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:11:59,306 INFO L225 Difference]: With dead ends: 459 [2024-10-11 03:11:59,307 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 03:11:59,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:11:59,310 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:11:59,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 551 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:11:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 03:11:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2024-10-11 03:11:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 180 states have (on average 1.4666666666666666) internal successors, (264), 184 states have internal predecessors, (264), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:11:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 319 transitions. [2024-10-11 03:11:59,334 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 319 transitions. Word has length 52 [2024-10-11 03:11:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:11:59,334 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 319 transitions. [2024-10-11 03:11:59,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 319 transitions. [2024-10-11 03:11:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:11:59,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:11:59,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:11:59,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:11:59,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:11:59,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:11:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1564136677, now seen corresponding path program 1 times [2024-10-11 03:11:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:11:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795004653] [2024-10-11 03:11:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:11:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:11:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:11:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:11:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:11:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:11:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:11:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:11:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:11:59,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795004653] [2024-10-11 03:11:59,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795004653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:11:59,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:11:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:11:59,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915341345] [2024-10-11 03:11:59,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:11:59,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:11:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:11:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:11:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:11:59,446 INFO L87 Difference]: Start difference. First operand 222 states and 319 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:11:59,595 INFO L93 Difference]: Finished difference Result 467 states and 684 transitions. [2024-10-11 03:11:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:11:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-11 03:11:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:11:59,598 INFO L225 Difference]: With dead ends: 467 [2024-10-11 03:11:59,598 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 03:11:59,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:11:59,600 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:11:59,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 514 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:11:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 03:11:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2024-10-11 03:11:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 184 states have (on average 1.4565217391304348) internal successors, (268), 188 states have internal predecessors, (268), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:11:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 323 transitions. [2024-10-11 03:11:59,627 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 323 transitions. Word has length 52 [2024-10-11 03:11:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:11:59,628 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 323 transitions. [2024-10-11 03:11:59,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:11:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 323 transitions. [2024-10-11 03:11:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:11:59,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:11:59,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:11:59,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:11:59,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:11:59,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:11:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1586768931, now seen corresponding path program 1 times [2024-10-11 03:11:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:11:59,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943281499] [2024-10-11 03:11:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:11:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:11:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:11:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:11:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:11:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:11:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:11:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:11:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:11:59,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:11:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943281499] [2024-10-11 03:11:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943281499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:11:59,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:11:59,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:11:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340689081] [2024-10-11 03:11:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:11:59,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:11:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:11:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:11:59,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:11:59,782 INFO L87 Difference]: Start difference. First operand 226 states and 323 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:00,246 INFO L93 Difference]: Finished difference Result 937 states and 1377 transitions. [2024-10-11 03:12:00,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:12:00,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-11 03:12:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:00,254 INFO L225 Difference]: With dead ends: 937 [2024-10-11 03:12:00,254 INFO L226 Difference]: Without dead ends: 720 [2024-10-11 03:12:00,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:12:00,256 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 723 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:00,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 863 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:12:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-10-11 03:12:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 425. [2024-10-11 03:12:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 349 states have (on average 1.4441260744985673) internal successors, (504), 355 states have internal predecessors, (504), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2024-10-11 03:12:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 606 transitions. [2024-10-11 03:12:00,301 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 606 transitions. Word has length 52 [2024-10-11 03:12:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:00,301 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 606 transitions. [2024-10-11 03:12:00,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 606 transitions. [2024-10-11 03:12:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:12:00,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:00,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:12:00,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:00,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 971286814, now seen corresponding path program 1 times [2024-10-11 03:12:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157200471] [2024-10-11 03:12:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:00,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:00,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157200471] [2024-10-11 03:12:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157200471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:12:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433285322] [2024-10-11 03:12:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:00,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:12:00,385 INFO L87 Difference]: Start difference. First operand 425 states and 606 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:00,561 INFO L93 Difference]: Finished difference Result 904 states and 1318 transitions. [2024-10-11 03:12:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:12:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-10-11 03:12:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:00,564 INFO L225 Difference]: With dead ends: 904 [2024-10-11 03:12:00,565 INFO L226 Difference]: Without dead ends: 488 [2024-10-11 03:12:00,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:00,568 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:00,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 514 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-11 03:12:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 433. [2024-10-11 03:12:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 357 states have (on average 1.4341736694677871) internal successors, (512), 363 states have internal predecessors, (512), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2024-10-11 03:12:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 614 transitions. [2024-10-11 03:12:00,602 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 614 transitions. Word has length 53 [2024-10-11 03:12:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:00,603 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 614 transitions. [2024-10-11 03:12:00,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 614 transitions. [2024-10-11 03:12:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:12:00,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:00,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:00,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:12:00,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:00,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1111835424, now seen corresponding path program 1 times [2024-10-11 03:12:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859678473] [2024-10-11 03:12:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859678473] [2024-10-11 03:12:00,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859678473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:00,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:00,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:12:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994338950] [2024-10-11 03:12:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:00,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:12:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:12:00,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:00,691 INFO L87 Difference]: Start difference. First operand 433 states and 614 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:12:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:00,934 INFO L93 Difference]: Finished difference Result 1349 states and 1927 transitions. [2024-10-11 03:12:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:12:00,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2024-10-11 03:12:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:00,939 INFO L225 Difference]: With dead ends: 1349 [2024-10-11 03:12:00,939 INFO L226 Difference]: Without dead ends: 926 [2024-10-11 03:12:00,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:12:00,940 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 233 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:00,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:12:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-11 03:12:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 808. [2024-10-11 03:12:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 668 states have (on average 1.4251497005988023) internal successors, (952), 682 states have internal predecessors, (952), 91 states have call successors, (91), 49 states have call predecessors, (91), 48 states have return successors, (93), 77 states have call predecessors, (93), 88 states have call successors, (93) [2024-10-11 03:12:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1136 transitions. [2024-10-11 03:12:00,988 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1136 transitions. Word has length 53 [2024-10-11 03:12:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:00,990 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1136 transitions. [2024-10-11 03:12:00,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:12:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1136 transitions. [2024-10-11 03:12:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:12:00,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:00,991 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:00,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:12:00,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:00,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2095343432, now seen corresponding path program 1 times [2024-10-11 03:12:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048013315] [2024-10-11 03:12:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:01,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048013315] [2024-10-11 03:12:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048013315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323329407] [2024-10-11 03:12:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:01,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:01,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:01,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:12:01,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:12:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 03:12:01,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:12:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:01,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:12:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323329407] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:01,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:12:01,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 5] total 8 [2024-10-11 03:12:01,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016124415] [2024-10-11 03:12:01,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:01,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:12:01,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:12:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:01,314 INFO L87 Difference]: Start difference. First operand 808 states and 1136 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:12:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:01,532 INFO L93 Difference]: Finished difference Result 2232 states and 3155 transitions. [2024-10-11 03:12:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:12:01,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2024-10-11 03:12:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:01,539 INFO L225 Difference]: With dead ends: 2232 [2024-10-11 03:12:01,539 INFO L226 Difference]: Without dead ends: 1525 [2024-10-11 03:12:01,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:12:01,542 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 277 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:01,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1151 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-10-11 03:12:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1510. [2024-10-11 03:12:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1254 states have (on average 1.4218500797448166) internal successors, (1783), 1277 states have internal predecessors, (1783), 165 states have call successors, (165), 91 states have call predecessors, (165), 90 states have return successors, (172), 142 states have call predecessors, (172), 162 states have call successors, (172) [2024-10-11 03:12:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2120 transitions. [2024-10-11 03:12:01,621 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2120 transitions. Word has length 64 [2024-10-11 03:12:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:01,621 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2120 transitions. [2024-10-11 03:12:01,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:12:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2120 transitions. [2024-10-11 03:12:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:12:01,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:01,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:01,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:12:01,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:01,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:01,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -850655386, now seen corresponding path program 1 times [2024-10-11 03:12:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626749749] [2024-10-11 03:12:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626749749] [2024-10-11 03:12:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626749749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:01,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:01,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:12:01,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262453367] [2024-10-11 03:12:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:01,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:12:01,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:01,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:12:01,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:01,920 INFO L87 Difference]: Start difference. First operand 1510 states and 2120 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:12:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:02,398 INFO L93 Difference]: Finished difference Result 4752 states and 6781 transitions. [2024-10-11 03:12:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:12:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2024-10-11 03:12:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:02,410 INFO L225 Difference]: With dead ends: 4752 [2024-10-11 03:12:02,411 INFO L226 Difference]: Without dead ends: 3252 [2024-10-11 03:12:02,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:12:02,415 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 396 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:02,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 522 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2024-10-11 03:12:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2964. [2024-10-11 03:12:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2487 states have (on average 1.403297145154805) internal successors, (3490), 2528 states have internal predecessors, (3490), 292 states have call successors, (292), 170 states have call predecessors, (292), 184 states have return successors, (401), 267 states have call predecessors, (401), 289 states have call successors, (401) [2024-10-11 03:12:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4183 transitions. [2024-10-11 03:12:02,592 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4183 transitions. Word has length 66 [2024-10-11 03:12:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:02,593 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 4183 transitions. [2024-10-11 03:12:02,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:12:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4183 transitions. [2024-10-11 03:12:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:12:02,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:02,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:12:02,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:02,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -648831452, now seen corresponding path program 1 times [2024-10-11 03:12:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526407074] [2024-10-11 03:12:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:02,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:02,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:02,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:02,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526407074] [2024-10-11 03:12:02,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526407074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:02,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:12:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733794863] [2024-10-11 03:12:02,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:02,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:02,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:02,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:02,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:12:02,645 INFO L87 Difference]: Start difference. First operand 2964 states and 4183 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:12:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:02,975 INFO L93 Difference]: Finished difference Result 6225 states and 8823 transitions. [2024-10-11 03:12:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:12:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2024-10-11 03:12:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:02,988 INFO L225 Difference]: With dead ends: 6225 [2024-10-11 03:12:02,988 INFO L226 Difference]: Without dead ends: 3270 [2024-10-11 03:12:02,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:02,996 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 287 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:02,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 266 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:12:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-10-11 03:12:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2959. [2024-10-11 03:12:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2485 states have (on average 1.4028169014084506) internal successors, (3486), 2525 states have internal predecessors, (3486), 289 states have call successors, (289), 170 states have call predecessors, (289), 184 states have return successors, (397), 264 states have call predecessors, (397), 286 states have call successors, (397) [2024-10-11 03:12:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4172 transitions. [2024-10-11 03:12:03,142 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4172 transitions. Word has length 66 [2024-10-11 03:12:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:03,142 INFO L471 AbstractCegarLoop]: Abstraction has 2959 states and 4172 transitions. [2024-10-11 03:12:03,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:12:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4172 transitions. [2024-10-11 03:12:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:12:03,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:03,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:03,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:12:03,144 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:03,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1187424253, now seen corresponding path program 1 times [2024-10-11 03:12:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041625211] [2024-10-11 03:12:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:03,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:03,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:03,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:03,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041625211] [2024-10-11 03:12:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041625211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:03,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:03,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:12:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215590144] [2024-10-11 03:12:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:12:03,193 INFO L87 Difference]: Start difference. First operand 2959 states and 4172 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:12:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:03,724 INFO L93 Difference]: Finished difference Result 8563 states and 12186 transitions. [2024-10-11 03:12:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:12:03,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 67 [2024-10-11 03:12:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:03,748 INFO L225 Difference]: With dead ends: 8563 [2024-10-11 03:12:03,748 INFO L226 Difference]: Without dead ends: 5613 [2024-10-11 03:12:03,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:12:03,759 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 349 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:03,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 420 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:12:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2024-10-11 03:12:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 4678. [2024-10-11 03:12:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4678 states, 3895 states have (on average 1.3650834403080874) internal successors, (5317), 3959 states have internal predecessors, (5317), 475 states have call successors, (475), 283 states have call predecessors, (475), 307 states have return successors, (665), 436 states have call predecessors, (665), 472 states have call successors, (665) [2024-10-11 03:12:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 6457 transitions. [2024-10-11 03:12:04,047 INFO L78 Accepts]: Start accepts. Automaton has 4678 states and 6457 transitions. Word has length 67 [2024-10-11 03:12:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:04,048 INFO L471 AbstractCegarLoop]: Abstraction has 4678 states and 6457 transitions. [2024-10-11 03:12:04,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:12:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4678 states and 6457 transitions. [2024-10-11 03:12:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:12:04,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:04,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:04,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:12:04,050 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:04,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash -588871477, now seen corresponding path program 1 times [2024-10-11 03:12:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:04,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669957820] [2024-10-11 03:12:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:04,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:04,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669957820] [2024-10-11 03:12:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669957820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:04,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:04,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:12:04,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978891467] [2024-10-11 03:12:04,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:04,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:12:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:12:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:04,149 INFO L87 Difference]: Start difference. First operand 4678 states and 6457 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:12:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:05,038 INFO L93 Difference]: Finished difference Result 12159 states and 16841 transitions. [2024-10-11 03:12:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:12:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 03:12:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:05,073 INFO L225 Difference]: With dead ends: 12159 [2024-10-11 03:12:05,074 INFO L226 Difference]: Without dead ends: 7652 [2024-10-11 03:12:05,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:12:05,088 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 720 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:05,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 495 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:12:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2024-10-11 03:12:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 6864. [2024-10-11 03:12:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6864 states, 5729 states have (on average 1.3655088148018852) internal successors, (7823), 5809 states have internal predecessors, (7823), 687 states have call successors, (687), 411 states have call predecessors, (687), 447 states have return successors, (971), 644 states have call predecessors, (971), 684 states have call successors, (971) [2024-10-11 03:12:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6864 states to 6864 states and 9481 transitions. [2024-10-11 03:12:05,529 INFO L78 Accepts]: Start accepts. Automaton has 6864 states and 9481 transitions. Word has length 68 [2024-10-11 03:12:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:05,530 INFO L471 AbstractCegarLoop]: Abstraction has 6864 states and 9481 transitions. [2024-10-11 03:12:05,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:12:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6864 states and 9481 transitions. [2024-10-11 03:12:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:12:05,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:05,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:05,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:12:05,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:05,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash -421261476, now seen corresponding path program 1 times [2024-10-11 03:12:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:05,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904167626] [2024-10-11 03:12:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:12:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:12:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904167626] [2024-10-11 03:12:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904167626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075371206] [2024-10-11 03:12:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:05,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:05,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:05,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:12:05,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:12:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:05,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:12:05,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:12:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:05,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:12:05,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075371206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:05,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:12:05,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 03:12:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641658312] [2024-10-11 03:12:05,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:05,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:12:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:12:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:05,668 INFO L87 Difference]: Start difference. First operand 6864 states and 9481 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:12:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:06,194 INFO L93 Difference]: Finished difference Result 18019 states and 25163 transitions. [2024-10-11 03:12:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:12:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2024-10-11 03:12:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:06,252 INFO L225 Difference]: With dead ends: 18019 [2024-10-11 03:12:06,252 INFO L226 Difference]: Without dead ends: 11165 [2024-10-11 03:12:06,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:06,269 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:06,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 437 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:12:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11165 states. [2024-10-11 03:12:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11165 to 10643. [2024-10-11 03:12:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10643 states, 8830 states have (on average 1.3558323895809739) internal successors, (11972), 8960 states have internal predecessors, (11972), 1097 states have call successors, (1097), 657 states have call predecessors, (1097), 715 states have return successors, (1717), 1027 states have call predecessors, (1717), 1094 states have call successors, (1717) [2024-10-11 03:12:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10643 states to 10643 states and 14786 transitions. [2024-10-11 03:12:07,161 INFO L78 Accepts]: Start accepts. Automaton has 10643 states and 14786 transitions. Word has length 71 [2024-10-11 03:12:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:07,162 INFO L471 AbstractCegarLoop]: Abstraction has 10643 states and 14786 transitions. [2024-10-11 03:12:07,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:12:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10643 states and 14786 transitions. [2024-10-11 03:12:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:12:07,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:07,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:07,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:12:07,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:07,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:07,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:07,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1122212262, now seen corresponding path program 1 times [2024-10-11 03:12:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:07,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398809888] [2024-10-11 03:12:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:12:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:12:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398809888] [2024-10-11 03:12:07,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398809888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:07,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:12:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798179042] [2024-10-11 03:12:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:07,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:12:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:12:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:07,449 INFO L87 Difference]: Start difference. First operand 10643 states and 14786 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:08,830 INFO L93 Difference]: Finished difference Result 26618 states and 37192 transitions. [2024-10-11 03:12:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:12:08,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2024-10-11 03:12:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:08,891 INFO L225 Difference]: With dead ends: 26618 [2024-10-11 03:12:08,892 INFO L226 Difference]: Without dead ends: 17340 [2024-10-11 03:12:08,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:12:08,917 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 740 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:08,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1052 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:12:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17340 states. [2024-10-11 03:12:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17340 to 14611. [2024-10-11 03:12:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14611 states, 12202 states have (on average 1.3667431568595312) internal successors, (16677), 12412 states have internal predecessors, (16677), 1425 states have call successors, (1425), 853 states have call predecessors, (1425), 983 states have return successors, (2443), 1347 states have call predecessors, (2443), 1422 states have call successors, (2443) [2024-10-11 03:12:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14611 states to 14611 states and 20545 transitions. [2024-10-11 03:12:09,795 INFO L78 Accepts]: Start accepts. Automaton has 14611 states and 20545 transitions. Word has length 77 [2024-10-11 03:12:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:09,796 INFO L471 AbstractCegarLoop]: Abstraction has 14611 states and 20545 transitions. [2024-10-11 03:12:09,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 14611 states and 20545 transitions. [2024-10-11 03:12:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:12:09,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:09,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:09,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:12:09,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:09,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 167760280, now seen corresponding path program 1 times [2024-10-11 03:12:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600536526] [2024-10-11 03:12:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:12:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:12:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600536526] [2024-10-11 03:12:09,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600536526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:09,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:09,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:12:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187578819] [2024-10-11 03:12:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:09,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:12:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:09,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:12:09,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:09,939 INFO L87 Difference]: Start difference. First operand 14611 states and 20545 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:11,973 INFO L93 Difference]: Finished difference Result 38017 states and 53573 transitions. [2024-10-11 03:12:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:12:11,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-10-11 03:12:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:12,066 INFO L225 Difference]: With dead ends: 38017 [2024-10-11 03:12:12,066 INFO L226 Difference]: Without dead ends: 24771 [2024-10-11 03:12:12,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:12:12,104 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 847 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:12,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1320 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:12:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24771 states. [2024-10-11 03:12:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24771 to 21057. [2024-10-11 03:12:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21057 states, 17640 states have (on average 1.373015873015873) internal successors, (24220), 17920 states have internal predecessors, (24220), 2016 states have call successors, (2016), 1207 states have call predecessors, (2016), 1400 states have return successors, (3536), 1931 states have call predecessors, (3536), 2013 states have call successors, (3536) [2024-10-11 03:12:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21057 states to 21057 states and 29772 transitions. [2024-10-11 03:12:13,266 INFO L78 Accepts]: Start accepts. Automaton has 21057 states and 29772 transitions. Word has length 80 [2024-10-11 03:12:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:13,266 INFO L471 AbstractCegarLoop]: Abstraction has 21057 states and 29772 transitions. [2024-10-11 03:12:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21057 states and 29772 transitions. [2024-10-11 03:12:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:12:13,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:13,270 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:12:13,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1527405945, now seen corresponding path program 1 times [2024-10-11 03:12:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861165838] [2024-10-11 03:12:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:12:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:12:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861165838] [2024-10-11 03:12:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861165838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:13,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:12:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694661773] [2024-10-11 03:12:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:13,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:12:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:12:13,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:13,334 INFO L87 Difference]: Start difference. First operand 21057 states and 29772 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:15,982 INFO L93 Difference]: Finished difference Result 64092 states and 92160 transitions. [2024-10-11 03:12:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:12:15,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2024-10-11 03:12:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:16,142 INFO L225 Difference]: With dead ends: 64092 [2024-10-11 03:12:16,142 INFO L226 Difference]: Without dead ends: 43049 [2024-10-11 03:12:16,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:12:16,203 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1085 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:16,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 890 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:12:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43049 states. [2024-10-11 03:12:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43049 to 40539. [2024-10-11 03:12:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40539 states, 33832 states have (on average 1.3446145660912745) internal successors, (45491), 34367 states have internal predecessors, (45491), 3900 states have call successors, (3900), 2376 states have call predecessors, (3900), 2806 states have return successors, (7008), 3797 states have call predecessors, (7008), 3897 states have call successors, (7008) [2024-10-11 03:12:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40539 states to 40539 states and 56399 transitions. [2024-10-11 03:12:18,868 INFO L78 Accepts]: Start accepts. Automaton has 40539 states and 56399 transitions. Word has length 86 [2024-10-11 03:12:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:18,868 INFO L471 AbstractCegarLoop]: Abstraction has 40539 states and 56399 transitions. [2024-10-11 03:12:18,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 40539 states and 56399 transitions. [2024-10-11 03:12:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 03:12:18,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:18,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:18,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:12:18,874 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash 253434099, now seen corresponding path program 1 times [2024-10-11 03:12:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797267153] [2024-10-11 03:12:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:12:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:12:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797267153] [2024-10-11 03:12:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797267153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580066717] [2024-10-11 03:12:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:18,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:12:18,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:12:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:19,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:12:19,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:12:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:19,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:12:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:12:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580066717] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 03:12:19,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:12:19,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 6] total 15 [2024-10-11 03:12:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120717689] [2024-10-11 03:12:19,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:19,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:12:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:12:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:12:19,246 INFO L87 Difference]: Start difference. First operand 40539 states and 56399 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:21,166 INFO L93 Difference]: Finished difference Result 42729 states and 59198 transitions. [2024-10-11 03:12:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:12:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2024-10-11 03:12:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:21,363 INFO L225 Difference]: With dead ends: 42729 [2024-10-11 03:12:21,363 INFO L226 Difference]: Without dead ends: 42726 [2024-10-11 03:12:21,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:12:21,392 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 379 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:21,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 977 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42726 states. [2024-10-11 03:12:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42726 to 41535. [2024-10-11 03:12:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41535 states, 34647 states have (on average 1.3413859785840043) internal successors, (46475), 35200 states have internal predecessors, (46475), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2881 states have return successors, (7155), 3893 states have call predecessors, (7155), 4003 states have call successors, (7155) [2024-10-11 03:12:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41535 states to 41535 states and 57636 transitions. [2024-10-11 03:12:23,936 INFO L78 Accepts]: Start accepts. Automaton has 41535 states and 57636 transitions. Word has length 87 [2024-10-11 03:12:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:23,936 INFO L471 AbstractCegarLoop]: Abstraction has 41535 states and 57636 transitions. [2024-10-11 03:12:23,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41535 states and 57636 transitions. [2024-10-11 03:12:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:12:23,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:23,942 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:23,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:12:24,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:12:24,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:24,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1399470103, now seen corresponding path program 1 times [2024-10-11 03:12:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416816127] [2024-10-11 03:12:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:12:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:12:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:12:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416816127] [2024-10-11 03:12:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416816127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:24,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:24,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:12:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866563586] [2024-10-11 03:12:24,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:24,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:12:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:12:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:24,234 INFO L87 Difference]: Start difference. First operand 41535 states and 57636 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:12:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:27,151 INFO L93 Difference]: Finished difference Result 86391 states and 119808 transitions. [2024-10-11 03:12:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:12:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-10-11 03:12:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:27,308 INFO L225 Difference]: With dead ends: 86391 [2024-10-11 03:12:27,308 INFO L226 Difference]: Without dead ends: 44870 [2024-10-11 03:12:27,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:12:27,386 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 349 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:27,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 462 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:12:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44870 states. [2024-10-11 03:12:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44870 to 41479. [2024-10-11 03:12:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41479 states, 34479 states have (on average 1.3318541721047594) internal successors, (45921), 35144 states have internal predecessors, (45921), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2993 states have return successors, (6707), 3893 states have call predecessors, (6707), 4003 states have call successors, (6707) [2024-10-11 03:12:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41479 states to 41479 states and 56634 transitions. [2024-10-11 03:12:30,472 INFO L78 Accepts]: Start accepts. Automaton has 41479 states and 56634 transitions. Word has length 89 [2024-10-11 03:12:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:30,473 INFO L471 AbstractCegarLoop]: Abstraction has 41479 states and 56634 transitions. [2024-10-11 03:12:30,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:12:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 41479 states and 56634 transitions. [2024-10-11 03:12:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:12:30,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:30,478 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:12:30,478 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:30,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1328739243, now seen corresponding path program 1 times [2024-10-11 03:12:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302452912] [2024-10-11 03:12:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:12:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:12:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 03:12:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302452912] [2024-10-11 03:12:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302452912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:12:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139445481] [2024-10-11 03:12:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:30,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:30,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:12:30,518 INFO L87 Difference]: Start difference. First operand 41479 states and 56634 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:32,659 INFO L93 Difference]: Finished difference Result 46943 states and 64319 transitions. [2024-10-11 03:12:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:12:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-10-11 03:12:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:32,809 INFO L225 Difference]: With dead ends: 46943 [2024-10-11 03:12:32,810 INFO L226 Difference]: Without dead ends: 44667 [2024-10-11 03:12:32,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:32,837 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 291 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:32,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 264 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:12:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44667 states. [2024-10-11 03:12:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44667 to 41329. [2024-10-11 03:12:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41329 states, 34359 states have (on average 1.3321400506417533) internal successors, (45771), 35022 states have internal predecessors, (45771), 3987 states have call successors, (3987), 2433 states have call predecessors, (3987), 2982 states have return successors, (6686), 3874 states have call predecessors, (6686), 3984 states have call successors, (6686) [2024-10-11 03:12:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41329 states to 41329 states and 56444 transitions. [2024-10-11 03:12:35,563 INFO L78 Accepts]: Start accepts. Automaton has 41329 states and 56444 transitions. Word has length 89 [2024-10-11 03:12:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:35,563 INFO L471 AbstractCegarLoop]: Abstraction has 41329 states and 56444 transitions. [2024-10-11 03:12:35,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 41329 states and 56444 transitions. [2024-10-11 03:12:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:12:35,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:35,568 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:35,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:12:35,568 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:35,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash 899233760, now seen corresponding path program 1 times [2024-10-11 03:12:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784385960] [2024-10-11 03:12:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:12:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:12:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:12:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:12:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:12:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:12:35,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:35,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784385960] [2024-10-11 03:12:35,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784385960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:35,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:12:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647183771] [2024-10-11 03:12:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:35,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:12:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:12:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:35,629 INFO L87 Difference]: Start difference. First operand 41329 states and 56444 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:12:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:38,894 INFO L93 Difference]: Finished difference Result 85171 states and 116371 transitions. [2024-10-11 03:12:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:12:38,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 90 [2024-10-11 03:12:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:39,067 INFO L225 Difference]: With dead ends: 85171 [2024-10-11 03:12:39,068 INFO L226 Difference]: Without dead ends: 43852 [2024-10-11 03:12:39,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:12:39,160 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1166 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:39,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 861 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:12:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43852 states.