./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.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 cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 23:10:56,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 23:10:56,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-22 23:10:56,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 23:10:56,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 23:10:57,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 23:10:57,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 23:10:57,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 23:10:57,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 23:10:57,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 23:10:57,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 23:10:57,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 23:10:57,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 23:10:57,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 23:10:57,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 23:10:57,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 23:10:57,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 23:10:57,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 23:10:57,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 23:10:57,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 23:10:57,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 23:10:57,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 23:10:57,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 23:10:57,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 23:10:57,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 23:10:57,018 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 23:10:57,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 23:10:57,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 23:10:57,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 23:10:57,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 23:10:57,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 23:10:57,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 23:10:57,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 23:10:57,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 23:10:57,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:10:57,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 23:10:57,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 23:10:57,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 23:10:57,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 23:10:57,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 23:10:57,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 23:10:57,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 23:10:57,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 23:10:57,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 23:10:57,023 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 -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2024-11-22 23:10:57,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 23:10:57,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 23:10:57,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 23:10:57,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 23:10:57,254 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 23:10:57,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-22 23:10:58,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 23:10:58,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 23:10:58,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-22 23:10:58,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6a54b299/264627825f8e4221bc64f98426f28ec5/FLAGeb9338368 [2024-11-22 23:10:59,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6a54b299/264627825f8e4221bc64f98426f28ec5 [2024-11-22 23:10:59,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 23:10:59,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 23:10:59,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 23:10:59,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 23:10:59,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 23:10:59,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f4eb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59, skipping insertion in model container [2024-11-22 23:10:59,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 23:10:59,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:10:59,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 23:10:59,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:10:59,793 INFO L204 MainTranslator]: Completed translation [2024-11-22 23:10:59,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59 WrapperNode [2024-11-22 23:10:59,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 23:10:59,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 23:10:59,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 23:10:59,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 23:10:59,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,848 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 518 [2024-11-22 23:10:59,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 23:10:59,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 23:10:59,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 23:10:59,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 23:10:59,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,888 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-22 23:10:59,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 23:10:59,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 23:10:59,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 23:10:59,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 23:10:59,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (1/1) ... [2024-11-22 23:10:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:10:59,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:10:59,938 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-22 23:10:59,949 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-22 23:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-22 23:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-22 23:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 23:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-22 23:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-22 23:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-22 23:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-22 23:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-22 23:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-22 23:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 23:10:59,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 23:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 23:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-22 23:10:59,981 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-22 23:10:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 23:10:59,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 23:10:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-22 23:10:59,982 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-22 23:11:00,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 23:11:00,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 23:11:00,554 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-22 23:11:00,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 23:11:00,572 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 23:11:00,573 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 23:11:00,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:11:00 BoogieIcfgContainer [2024-11-22 23:11:00,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 23:11:00,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 23:11:00,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 23:11:00,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 23:11:00,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:10:59" (1/3) ... [2024-11-22 23:11:00,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f697e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:11:00, skipping insertion in model container [2024-11-22 23:11:00,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:59" (2/3) ... [2024-11-22 23:11:00,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f697e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:11:00, skipping insertion in model container [2024-11-22 23:11:00,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:11:00" (3/3) ... [2024-11-22 23:11:00,582 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-22 23:11:00,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 23:11:00,594 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 23:11:00,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 23:11:00,660 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;@7466c455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 23:11:00,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 23:11:00,665 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-22 23:11:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 23:11:00,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:00,680 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-22 23:11:00,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-22 23:11:00,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1720236815, now seen corresponding path program 1 times [2024-11-22 23:11:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214477867] [2024-11-22 23:11:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-22 23:11:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214477867] [2024-11-22 23:11:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214477867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:00,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865996798] [2024-11-22 23:11:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:00,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:00,983 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-22 23:11:00,987 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-22 23:11:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:01,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 23:11:01,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-22 23:11:01,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865996798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 23:11:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367639031] [2024-11-22 23:11:01,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:01,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 23:11:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:01,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 23:11:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 23:11:01,197 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 23:11:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:01,239 INFO L93 Difference]: Finished difference Result 353 states and 569 transitions. [2024-11-22 23:11:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 23:11:01,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2024-11-22 23:11:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:01,251 INFO L225 Difference]: With dead ends: 353 [2024-11-22 23:11:01,251 INFO L226 Difference]: Without dead ends: 179 [2024-11-22 23:11:01,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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-22 23:11:01,260 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-22 23:11:01,261 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-22 23:11:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-22 23:11:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-22 23:11:01,314 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-22 23:11:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2024-11-22 23:11:01,319 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 71 [2024-11-22 23:11:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:01,320 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2024-11-22 23:11:01,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 23:11:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2024-11-22 23:11:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 23:11:01,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:01,326 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-22 23:11:01,335 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-22 23:11:01,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 23:11:01,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-22 23:11:01,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -956816523, now seen corresponding path program 1 times [2024-11-22 23:11:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121916191] [2024-11-22 23:11:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:01,818 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-22 23:11:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121916191] [2024-11-22 23:11:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121916191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637742506] [2024-11-22 23:11:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:01,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:01,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:01,824 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-22 23:11:01,825 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-22 23:11:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:01,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 23:11:01,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:02,071 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-22 23:11:02,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637742506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:02,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-22 23:11:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112460045] [2024-11-22 23:11:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:02,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:11:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:11:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:11:02,074 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-22 23:11:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:02,248 INFO L93 Difference]: Finished difference Result 394 states and 598 transitions. [2024-11-22 23:11:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:11:02,250 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-22 23:11:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:02,253 INFO L225 Difference]: With dead ends: 394 [2024-11-22 23:11:02,254 INFO L226 Difference]: Without dead ends: 232 [2024-11-22 23:11:02,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-22 23:11:02,256 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-22 23:11:02,257 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-22 23:11:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-22 23:11:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2024-11-22 23:11:02,287 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-22 23:11:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 345 transitions. [2024-11-22 23:11:02,291 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 345 transitions. Word has length 71 [2024-11-22 23:11:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:02,292 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 345 transitions. [2024-11-22 23:11:02,292 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-22 23:11:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 345 transitions. [2024-11-22 23:11:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-22 23:11:02,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:02,296 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-22 23:11:02,309 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-22 23:11:02,497 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,SelfDestructingSolverStorable1 [2024-11-22 23:11:02,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-22 23:11:02,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1221807773, now seen corresponding path program 1 times [2024-11-22 23:11:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469919651] [2024-11-22 23:11:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:02,633 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-22 23:11:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469919651] [2024-11-22 23:11:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469919651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68879916] [2024-11-22 23:11:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:02,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:02,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:02,636 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-22 23:11:02,637 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-22 23:11:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:02,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 23:11:02,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:02,796 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-22 23:11:02,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68879916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:02,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-22 23:11:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693416787] [2024-11-22 23:11:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:02,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:11:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:11:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:11:02,798 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-22 23:11:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:02,935 INFO L93 Difference]: Finished difference Result 395 states and 598 transitions. [2024-11-22 23:11:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:11:02,936 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-22 23:11:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:02,937 INFO L225 Difference]: With dead ends: 395 [2024-11-22 23:11:02,937 INFO L226 Difference]: Without dead ends: 233 [2024-11-22 23:11:02,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-22 23:11:02,939 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-22 23:11:02,943 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-22 23:11:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-22 23:11:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2024-11-22 23:11:02,955 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-22 23:11:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 347 transitions. [2024-11-22 23:11:02,957 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 347 transitions. Word has length 72 [2024-11-22 23:11:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:02,957 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 347 transitions. [2024-11-22 23:11:02,958 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-22 23:11:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 347 transitions. [2024-11-22 23:11:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 23:11:02,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:02,959 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-22 23:11:02,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 23:11:03,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:03,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-22 23:11:03,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:03,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1559821585, now seen corresponding path program 1 times [2024-11-22 23:11:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:03,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083360560] [2024-11-22 23:11:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:03,255 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-22 23:11:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083360560] [2024-11-22 23:11:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083360560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492015520] [2024-11-22 23:11:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:03,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:03,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:03,258 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-22 23:11:03,259 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-22 23:11:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:03,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 23:11:03,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:03,415 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-22 23:11:03,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492015520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-22 23:11:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691309548] [2024-11-22 23:11:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:11:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:03,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:11:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 23:11:03,418 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-22 23:11:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:03,456 INFO L93 Difference]: Finished difference Result 230 states and 347 transitions. [2024-11-22 23:11:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:11:03,457 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-22 23:11:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:03,458 INFO L225 Difference]: With dead ends: 230 [2024-11-22 23:11:03,458 INFO L226 Difference]: Without dead ends: 229 [2024-11-22 23:11:03,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 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-22 23:11:03,459 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-22 23:11:03,459 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-22 23:11:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-22 23:11:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-22 23:11:03,471 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-22 23:11:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 346 transitions. [2024-11-22 23:11:03,474 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 346 transitions. Word has length 74 [2024-11-22 23:11:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:03,475 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 346 transitions. [2024-11-22 23:11:03,475 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-22 23:11:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2024-11-22 23:11:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 23:11:03,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:03,476 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-22 23:11:03,485 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-22 23:11:03,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:03,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-22 23:11:03,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1109828355, now seen corresponding path program 1 times [2024-11-22 23:11:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187532542] [2024-11-22 23:11:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:03,765 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-22 23:11:03,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187532542] [2024-11-22 23:11:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187532542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532599686] [2024-11-22 23:11:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:03,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:03,784 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-22 23:11:03,785 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-22 23:11:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:03,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 23:11:03,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:03,942 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-22 23:11:03,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532599686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:03,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-22 23:11:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481667115] [2024-11-22 23:11:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:03,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:11:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:03,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:11:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 23:11:03,944 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-22 23:11:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:03,968 INFO L93 Difference]: Finished difference Result 310 states and 478 transitions. [2024-11-22 23:11:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:11:03,969 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-22 23:11:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:03,971 INFO L225 Difference]: With dead ends: 310 [2024-11-22 23:11:03,971 INFO L226 Difference]: Without dead ends: 309 [2024-11-22 23:11:03,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 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-22 23:11:03,972 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-22 23:11:03,972 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-22 23:11:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-22 23:11:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-22 23:11:03,994 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-22 23:11:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 477 transitions. [2024-11-22 23:11:03,996 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 477 transitions. Word has length 75 [2024-11-22 23:11:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:03,996 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 477 transitions. [2024-11-22 23:11:03,996 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-22 23:11:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 477 transitions. [2024-11-22 23:11:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 23:11:03,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:03,998 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-22 23:11:04,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 23:11:04,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:04,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-22 23:11:04,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1091561665, now seen corresponding path program 1 times [2024-11-22 23:11:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:04,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939751105] [2024-11-22 23:11:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:04,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:04,334 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-22 23:11:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939751105] [2024-11-22 23:11:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939751105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630703556] [2024-11-22 23:11:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:04,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 23:11:04,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 23:11:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:04,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 23:11:04,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:04,577 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-22 23:11:04,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 23:11:04,743 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-22 23:11:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630703556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 23:11:04,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 23:11:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-22 23:11:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329840188] [2024-11-22 23:11:04,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 23:11:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 23:11:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 23:11:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-22 23:11:04,745 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-22 23:11:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:04,949 INFO L93 Difference]: Finished difference Result 719 states and 1119 transitions. [2024-11-22 23:11:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 23:11:04,949 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-22 23:11:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:04,950 INFO L225 Difference]: With dead ends: 719 [2024-11-22 23:11:04,950 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 23:11:04,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 266 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-22 23:11:04,952 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 557 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:04,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2290 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:11:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 23:11:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 23:11:04,953 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-22 23:11:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 23:11:04,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2024-11-22 23:11:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:04,954 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 23:11:04,954 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-22 23:11:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 23:11:04,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 23:11:04,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-22 23:11:04,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-22 23:11:04,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 23:11:05,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:05,161 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 23:11:05,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 23:11:05,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 23:11:05,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:11:05 BoogieIcfgContainer [2024-11-22 23:11:05,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 23:11:05,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 23:11:05,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 23:11:05,645 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 23:11:05,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:11:00" (3/4) ... [2024-11-22 23:11:05,651 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 23:11:05,659 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history [2024-11-22 23:11:05,659 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure flip_the_side [2024-11-22 23:11:05,659 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history [2024-11-22 23:11:05,659 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-22 23:11:05,659 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history [2024-11-22 23:11:05,659 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 23:11:05,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_active_side_history [2024-11-22 23:11:05,673 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-22 23:11:05,674 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 23:11:05,674 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 23:11:05,675 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 23:11:05,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 23:11:05,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 23:11:05,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 23:11:05,800 INFO L158 Benchmark]: Toolchain (without parser) took 6465.20ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 92.8MB in the beginning and 88.1MB in the end (delta: 4.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-11-22 23:11:05,800 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:11:05,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.41ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 126.4MB in the end (delta: -33.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-22 23:11:05,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.31ms. Allocated memory is still 159.4MB. Free memory was 126.4MB in the beginning and 122.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 23:11:05,801 INFO L158 Benchmark]: Boogie Preprocessor took 60.42ms. Allocated memory is still 159.4MB. Free memory was 122.9MB in the beginning and 118.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 23:11:05,801 INFO L158 Benchmark]: RCFGBuilder took 663.70ms. Allocated memory is still 159.4MB. Free memory was 118.1MB in the beginning and 74.6MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-22 23:11:05,801 INFO L158 Benchmark]: TraceAbstraction took 5070.00ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 74.0MB in the beginning and 101.7MB in the end (delta: -27.7MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2024-11-22 23:11:05,802 INFO L158 Benchmark]: Witness Printer took 154.92ms. Allocated memory is still 237.0MB. Free memory was 101.7MB in the beginning and 88.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 23:11:05,803 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.18ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.41ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 126.4MB in the end (delta: -33.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.31ms. Allocated memory is still 159.4MB. Free memory was 126.4MB in the beginning and 122.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.42ms. Allocated memory is still 159.4MB. Free memory was 122.9MB in the beginning and 118.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 663.70ms. Allocated memory is still 159.4MB. Free memory was 118.1MB in the beginning and 74.6MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5070.00ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 74.0MB in the beginning and 101.7MB in the end (delta: -27.7MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Witness Printer took 154.92ms. Allocated memory is still 237.0MB. Free memory was 101.7MB in the beginning and 88.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1678 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1576 mSDsluCounter, 5454 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3882 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 1572 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 624 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.3s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1818 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2960 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 250/338 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-22 23:11:05,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE