./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:10:44,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:10:44,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 19:10:44,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:10:44,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:10:44,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:10:44,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:10:44,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:10:44,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:10:44,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:10:44,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:10:44,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:10:44,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:10:44,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:10:44,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:10:44,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:10:44,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:10:44,275 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 19:10:44,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:10:44,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 19:10:44,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:10:44,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:10:44,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:10:44,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:10:44,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:10:44,279 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:10:44,279 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:10:44,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 19:10:44,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:10:44,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:10:44,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:10:44,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:10:44,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:10:44,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:10:44,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:10:44,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:10:44,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:10:44,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:10:44,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:10:44,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:10:44,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:10:44,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:10:44,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:10:44,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:10:44,283 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/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/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 ! overflow) ) 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 -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2024-11-20 19:10:44,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:10:44,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:10:44,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:10:44,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:10:44,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:10:44,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-20 19:10:45,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:10:45,948 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:10:45,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-20 19:10:45,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806801326/2e699d2747ec41d4b51eed8527401056/FLAGe7b55958e [2024-11-20 19:10:46,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806801326/2e699d2747ec41d4b51eed8527401056 [2024-11-20 19:10:46,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:10:46,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:10:46,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:10:46,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:10:46,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:10:46,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5f1cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46, skipping insertion in model container [2024-11-20 19:10:46,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:10:46,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:10:46,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:10:46,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:10:46,641 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:10:46,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46 WrapperNode [2024-11-20 19:10:46,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:10:46,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:10:46,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:10:46,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:10:46,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,681 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 518 [2024-11-20 19:10:46,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:10:46,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:10:46,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:10:46,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:10:46,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,721 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-11-20 19:10:46,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:10:46,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:10:46,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:10:46,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:10:46,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (1/1) ... [2024-11-20 19:10:46,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:10:46,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:46,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 19:10:46,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 19:10:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-20 19:10:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-20 19:10:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:10:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-20 19:10:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-20 19:10:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-20 19:10:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-20 19:10:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-20 19:10:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-20 19:10:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 19:10:46,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 19:10:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:10:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-20 19:10:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-20 19:10:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:10:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:10:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-20 19:10:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-20 19:10:46,931 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:10:46,933 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:10:47,395 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-20 19:10:47,395 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:10:47,407 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:10:47,407 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 19:10:47,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:47 BoogieIcfgContainer [2024-11-20 19:10:47,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:10:47,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:10:47,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:10:47,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:10:47,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:10:46" (1/3) ... [2024-11-20 19:10:47,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30145481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:47, skipping insertion in model container [2024-11-20 19:10:47,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:46" (2/3) ... [2024-11-20 19:10:47,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30145481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:47, skipping insertion in model container [2024-11-20 19:10:47,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:47" (3/3) ... [2024-11-20 19:10:47,414 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-20 19:10:47,426 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:10:47,427 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 19:10:47,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:10:47,491 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;@cd1c431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:10:47,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 19:10:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 146 states have internal predecessors, (223), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 19:10:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 19:10:47,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:47,509 INFO L215 NwaCegarLoop]: trace histogram [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-11-20 19:10:47,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:47,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1720236815, now seen corresponding path program 1 times [2024-11-20 19:10:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:47,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636944354] [2024-11-20 19:10:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 19:10:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 19:10:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 19:10:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 19:10:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:10:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 19:10:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 19:10:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636944354] [2024-11-20 19:10:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636944354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:10:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:10:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 19:10:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897906316] [2024-11-20 19:10:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:10:47,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 19:10:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:47,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 19:10:47,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:10:47,865 INFO L87 Difference]: Start difference. First operand has 185 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 146 states have internal predecessors, (223), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 19:10:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:47,896 INFO L93 Difference]: Finished difference Result 353 states and 569 transitions. [2024-11-20 19:10:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 19:10:47,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2024-11-20 19:10:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:47,904 INFO L225 Difference]: With dead ends: 353 [2024-11-20 19:10:47,904 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 19:10:47,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:10:47,910 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:47,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:10:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 19:10:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-20 19:10:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.539568345323741) internal successors, (214), 140 states have internal predecessors, (214), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 19:10:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2024-11-20 19:10:47,957 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 71 [2024-11-20 19:10:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:47,957 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2024-11-20 19:10:47,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 19:10:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2024-11-20 19:10:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 19:10:47,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:47,963 INFO L215 NwaCegarLoop]: trace histogram [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-11-20 19:10:47,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 19:10:47,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:47,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash -956816523, now seen corresponding path program 1 times [2024-11-20 19:10:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533594621] [2024-11-20 19:10:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:47,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 19:10:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 19:10:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 19:10:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 19:10:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:10:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 19:10:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:10:48,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533594621] [2024-11-20 19:10:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533594621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:10:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288478476] [2024-11-20 19:10:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:48,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:48,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:10:48,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 19:10:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:10:48,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:10:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:10:48,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:10:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288478476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:10:48,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:10:48,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-20 19:10:48,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511832764] [2024-11-20 19:10:48,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:10:48,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:10:48,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:10:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:10:48,451 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:10:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:48,603 INFO L93 Difference]: Finished difference Result 394 states and 598 transitions. [2024-11-20 19:10:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:10:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2024-11-20 19:10:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:48,605 INFO L225 Difference]: With dead ends: 394 [2024-11-20 19:10:48,605 INFO L226 Difference]: Without dead ends: 232 [2024-11-20 19:10:48,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:10:48,608 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 405 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:48,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 714 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:10:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-20 19:10:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2024-11-20 19:10:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 182 states have internal predecessors, (275), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 19:10:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 345 transitions. [2024-11-20 19:10:48,628 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 345 transitions. Word has length 71 [2024-11-20 19:10:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:48,628 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 345 transitions. [2024-11-20 19:10:48,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:10:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 345 transitions. [2024-11-20 19:10:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-20 19:10:48,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:48,630 INFO L215 NwaCegarLoop]: trace histogram [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-11-20 19:10:48,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 19:10:48,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:48,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:48,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1221807773, now seen corresponding path program 1 times [2024-11-20 19:10:48,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:48,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642282999] [2024-11-20 19:10:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 19:10:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-20 19:10:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 19:10:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 19:10:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:10:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 19:10:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:10:48,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642282999] [2024-11-20 19:10:48,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642282999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:10:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601334006] [2024-11-20 19:10:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:48,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:10:48,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 19:10:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:10:49,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:10:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:10:49,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:10:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601334006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:10:49,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:10:49,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-20 19:10:49,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785367673] [2024-11-20 19:10:49,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:10:49,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:10:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:49,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:10:49,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:10:49,164 INFO L87 Difference]: Start difference. First operand 228 states and 345 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:10:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:49,300 INFO L93 Difference]: Finished difference Result 395 states and 598 transitions. [2024-11-20 19:10:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:10:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2024-11-20 19:10:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:49,310 INFO L225 Difference]: With dead ends: 395 [2024-11-20 19:10:49,313 INFO L226 Difference]: Without dead ends: 233 [2024-11-20 19:10:49,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:10:49,315 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 405 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:49,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 714 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:10:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-20 19:10:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2024-11-20 19:10:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.5136612021857923) internal successors, (277), 184 states have internal predecessors, (277), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 19:10:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 347 transitions. [2024-11-20 19:10:49,343 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 347 transitions. Word has length 72 [2024-11-20 19:10:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:49,343 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 347 transitions. [2024-11-20 19:10:49,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:10:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 347 transitions. [2024-11-20 19:10:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 19:10:49,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:49,347 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 19:10:49,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 19:10:49,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-20 19:10:49,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:49,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1559821585, now seen corresponding path program 1 times [2024-11-20 19:10:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:49,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096835019] [2024-11-20 19:10:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:10:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:10:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:10:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-20 19:10:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 19:10:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 19:10:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:10:49,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096835019] [2024-11-20 19:10:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096835019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:10:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790420404] [2024-11-20 19:10:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:49,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:49,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:49,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:10:49,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 19:10:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:49,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:10:49,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:10:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 19:10:49,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:10:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790420404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:10:49,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:10:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-20 19:10:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602778550] [2024-11-20 19:10:49,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:10:49,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:10:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:10:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:10:49,846 INFO L87 Difference]: Start difference. First operand 230 states and 347 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 19:10:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:49,868 INFO L93 Difference]: Finished difference Result 230 states and 347 transitions. [2024-11-20 19:10:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:10:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-11-20 19:10:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:49,871 INFO L225 Difference]: With dead ends: 230 [2024-11-20 19:10:49,871 INFO L226 Difference]: Without dead ends: 229 [2024-11-20 19:10:49,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:10:49,873 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:49,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 647 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:10:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-20 19:10:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-20 19:10:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 183 states have (on average 1.5081967213114753) internal successors, (276), 183 states have internal predecessors, (276), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 19:10:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 346 transitions. [2024-11-20 19:10:49,888 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 346 transitions. Word has length 74 [2024-11-20 19:10:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:49,888 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 346 transitions. [2024-11-20 19:10:49,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 19:10:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2024-11-20 19:10:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 19:10:49,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:49,890 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 19:10:49,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 19:10:50,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:50,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:50,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1109828355, now seen corresponding path program 1 times [2024-11-20 19:10:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769169930] [2024-11-20 19:10:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:10:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:10:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:10:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-20 19:10:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 19:10:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 19:10:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:10:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769169930] [2024-11-20 19:10:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769169930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:10:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066292387] [2024-11-20 19:10:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:50,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:50,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:50,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:10:50,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 19:10:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:10:50,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:10:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 19:10:50,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:10:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066292387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:10:50,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:10:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-20 19:10:50,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655116547] [2024-11-20 19:10:50,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:10:50,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:10:50,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:10:50,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:10:50,390 INFO L87 Difference]: Start difference. First operand 229 states and 346 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 19:10:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:50,423 INFO L93 Difference]: Finished difference Result 310 states and 478 transitions. [2024-11-20 19:10:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:10:50,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-11-20 19:10:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:50,427 INFO L225 Difference]: With dead ends: 310 [2024-11-20 19:10:50,427 INFO L226 Difference]: Without dead ends: 309 [2024-11-20 19:10:50,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:10:50,428 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 101 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:50,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 808 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:10:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-20 19:10:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-20 19:10:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 states have internal predecessors, (361), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 19:10:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 477 transitions. [2024-11-20 19:10:50,447 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 477 transitions. Word has length 75 [2024-11-20 19:10:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 477 transitions. [2024-11-20 19:10:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-20 19:10:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 477 transitions. [2024-11-20 19:10:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 19:10:50,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:50,453 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-20 19:10:50,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 19:10:50,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:50,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:50,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1091561665, now seen corresponding path program 1 times [2024-11-20 19:10:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655699267] [2024-11-20 19:10:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:10:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:10:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:10:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-20 19:10:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 19:10:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 19:10:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 19:10:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 19:10:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:10:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 19:10:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 19:10:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 19:10:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 19:10:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-20 19:10:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655699267] [2024-11-20 19:10:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655699267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:10:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073786981] [2024-11-20 19:10:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:50,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:50,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:10:50,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 19:10:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:50,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:10:50,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:10:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-20 19:10:51,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:10:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-20 19:10:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073786981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:10:51,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:10:51,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-20 19:10:51,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891734966] [2024-11-20 19:10:51,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:10:51,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 19:10:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:51,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 19:10:51,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-20 19:10:51,212 INFO L87 Difference]: Start difference. First operand 309 states and 477 transitions. Second operand has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 14 states have internal predecessors, (176), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37) [2024-11-20 19:10:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:51,397 INFO L93 Difference]: Finished difference Result 719 states and 1119 transitions. [2024-11-20 19:10:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 19:10:51,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 14 states have internal predecessors, (176), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37) Word has length 137 [2024-11-20 19:10:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:51,398 INFO L225 Difference]: With dead ends: 719 [2024-11-20 19:10:51,398 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 19:10:51,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-20 19:10:51,400 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 552 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:51,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2422 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:10:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 19:10:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 19:10:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 19:10:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 19:10:51,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2024-11-20 19:10:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:51,401 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 19:10:51,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 14 states have internal predecessors, (176), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37) [2024-11-20 19:10:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 19:10:51,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 19:10:51,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 19:10:51,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 19:10:51,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 19:10:51,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:51,608 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 19:10:51,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 19:10:52,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:10:52,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:10:52 BoogieIcfgContainer [2024-11-20 19:10:52,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:10:52,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:10:52,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:10:52,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:10:52,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:47" (3/4) ... [2024-11-20 19:10:52,104 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 19:10:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history [2024-11-20 19:10:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure flip_the_side [2024-11-20 19:10:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history [2024-11-20 19:10:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-20 19:10:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history [2024-11-20 19:10:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 19:10:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_active_side_history [2024-11-20 19:10:52,123 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-20 19:10:52,124 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 19:10:52,124 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 19:10:52,125 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 19:10:52,241 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 19:10:52,241 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 19:10:52,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:10:52,242 INFO L158 Benchmark]: Toolchain (without parser) took 5916.82ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 97.2MB in the beginning and 200.7MB in the end (delta: -103.5MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-20 19:10:52,242 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:10:52,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.64ms. Allocated memory is still 146.8MB. Free memory was 97.2MB in the beginning and 76.9MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 19:10:52,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.33ms. Allocated memory is still 146.8MB. Free memory was 76.9MB in the beginning and 73.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 19:10:52,243 INFO L158 Benchmark]: Boogie Preprocessor took 79.17ms. Allocated memory is still 146.8MB. Free memory was 73.1MB in the beginning and 68.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 19:10:52,243 INFO L158 Benchmark]: RCFGBuilder took 646.72ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 68.1MB in the beginning and 148.9MB in the end (delta: -80.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-20 19:10:52,243 INFO L158 Benchmark]: TraceAbstraction took 4688.57ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 147.9MB in the beginning and 214.3MB in the end (delta: -66.5MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2024-11-20 19:10:52,243 INFO L158 Benchmark]: Witness Printer took 142.72ms. Allocated memory is still 255.9MB. Free memory was 214.3MB in the beginning and 200.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 19:10:52,244 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.64ms. Allocated memory is still 146.8MB. Free memory was 97.2MB in the beginning and 76.9MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.33ms. Allocated memory is still 146.8MB. Free memory was 76.9MB in the beginning and 73.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.17ms. Allocated memory is still 146.8MB. Free memory was 73.1MB in the beginning and 68.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 646.72ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 68.1MB in the beginning and 148.9MB in the end (delta: -80.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4688.57ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 147.9MB in the beginning and 214.3MB in the end (delta: -66.5MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. * Witness Printer took 142.72ms. Allocated memory is still 255.9MB. Free memory was 214.3MB in the beginning and 200.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 185 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1673 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1571 mSDsluCounter, 5586 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4014 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 1572 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1054 ConstructedInterpolants, 0 QuantifiedInterpolants, 1748 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2511 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 244/330 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((0 <= i2) && (i2 <= 2147483646)) && (((short) nomsg + 1) <= 0)) - ProcedureContractResult [Line: 173]: Procedure Contract for read_manual_selection_history Derived contract for procedure read_manual_selection_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 236]: Procedure Contract for flip_the_side Derived contract for procedure flip_the_side. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 113]: Procedure Contract for read_side2_failed_history Derived contract for procedure read_side2_failed_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 612]: Procedure Contract for assert Derived contract for procedure assert. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 83]: Procedure Contract for read_side1_failed_history Derived contract for procedure read_side1_failed_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 57]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((short) nomsg + 1) <= 0) Ensures: (((cond != 0) && (((short) nomsg + 1) <= 0)) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 143]: Procedure Contract for read_active_side_history Derived contract for procedure read_active_side_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) RESULT: Ultimate proved your program to be correct! [2024-11-20 19:10:52,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE