./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:03:10,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:03:10,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 05:03:10,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:03:10,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:03:10,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:03:10,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:03:10,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:03:10,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:03:10,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:03:10,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:03:10,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:03:10,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:03:10,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:03:10,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:03:10,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:03:10,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:03:10,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 05:03:10,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 05:03:10,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 05:03:10,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:03:10,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:03:10,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:03:10,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:03:10,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:03:10,826 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:03:10,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:03:10,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 05:03:10,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:03:10,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:03:10,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:03:10,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:03:10,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:03:10,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:03:10,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:03:10,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:03:10,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:03:10,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:03:10,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 05:03:10,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 05:03:10,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:03:10,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:03:10,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:03:10,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:03:10,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2024-11-17 05:03:11,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:03:11,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:03:11,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:03:11,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:03:11,049 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:03:11,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-17 05:03:12,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:03:12,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:03:12,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-17 05:03:12,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5817dee76/32574ce08f104a8ab5f331ad84dc8320/FLAG4e53bf78f [2024-11-17 05:03:12,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5817dee76/32574ce08f104a8ab5f331ad84dc8320 [2024-11-17 05:03:12,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:03:12,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:03:12,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:03:12,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:03:12,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:03:12,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:03:12" (1/1) ... [2024-11-17 05:03:12,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7850e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:12, skipping insertion in model container [2024-11-17 05:03:12,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:03:12" (1/1) ... [2024-11-17 05:03:12,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:03:13,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:03:13,159 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:03:13,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:03:13,239 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:03:13,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13 WrapperNode [2024-11-17 05:03:13,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:03:13,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:03:13,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:03:13,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:03:13,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,300 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 517 [2024-11-17 05:03:13,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:03:13,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:03:13,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:03:13,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:03:13,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,339 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-17 05:03:13,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:03:13,372 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:03:13,376 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:03:13,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:03:13,377 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (1/1) ... [2024-11-17 05:03:13,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:03:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:13,407 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-17 05:03:13,409 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-17 05:03:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-17 05:03:13,443 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-17 05:03:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:03:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-17 05:03:13,444 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-17 05:03:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-17 05:03:13,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-17 05:03:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-17 05:03:13,444 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-17 05:03:13,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-17 05:03:13,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-17 05:03:13,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 05:03:13,446 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-17 05:03:13,446 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-17 05:03:13,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:03:13,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:03:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-17 05:03:13,447 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-17 05:03:13,534 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:03:13,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:03:14,009 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-17 05:03:14,009 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:03:14,025 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:03:14,025 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:03:14,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:03:14 BoogieIcfgContainer [2024-11-17 05:03:14,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:03:14,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:03:14,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:03:14,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:03:14,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:03:12" (1/3) ... [2024-11-17 05:03:14,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da013cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:03:14, skipping insertion in model container [2024-11-17 05:03:14,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:13" (2/3) ... [2024-11-17 05:03:14,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da013cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:03:14, skipping insertion in model container [2024-11-17 05:03:14,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:03:14" (3/3) ... [2024-11-17 05:03:14,031 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-17 05:03:14,042 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:03:14,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 05:03:14,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:03:14,092 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;@4f7b6812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:03:14,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 05:03:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 153 states have internal predecessors, (230), 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-17 05:03:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 05:03:14,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:14,109 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-17 05:03:14,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:14,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:14,114 INFO L85 PathProgramCache]: Analyzing trace with hash -150281968, now seen corresponding path program 1 times [2024-11-17 05:03:14,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:14,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138690843] [2024-11-17 05:03:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-17 05:03:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-17 05:03:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 05:03:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-17 05:03:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-17 05:03:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 05:03:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,439 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-17 05:03:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:14,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138690843] [2024-11-17 05:03:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138690843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:14,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:03:14,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 05:03:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725340044] [2024-11-17 05:03:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:14,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 05:03:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 05:03:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:03:14,469 INFO L87 Difference]: Start difference. First operand has 192 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 153 states have internal predecessors, (230), 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.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-17 05:03:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:14,513 INFO L93 Difference]: Finished difference Result 367 states and 583 transitions. [2024-11-17 05:03:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 05:03:14,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2024-11-17 05:03:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:14,525 INFO L225 Difference]: With dead ends: 367 [2024-11-17 05:03:14,526 INFO L226 Difference]: Without dead ends: 186 [2024-11-17 05:03:14,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:03:14,533 INFO L432 NwaCegarLoop]: 288 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, 288 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-17 05:03:14,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:03:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-17 05:03:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-17 05:03:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 147 states have internal predecessors, (221), 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-17 05:03:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 283 transitions. [2024-11-17 05:03:14,588 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 283 transitions. Word has length 72 [2024-11-17 05:03:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 283 transitions. [2024-11-17 05:03:14,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-17 05:03:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 283 transitions. [2024-11-17 05:03:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 05:03:14,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:14,595 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-17 05:03:14,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 05:03:14,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:14,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:14,595 INFO L85 PathProgramCache]: Analyzing trace with hash 708534384, now seen corresponding path program 1 times [2024-11-17 05:03:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22147993] [2024-11-17 05:03:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-17 05:03:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-17 05:03:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 05:03:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-17 05:03:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-17 05:03:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 05:03:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:14,870 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-17 05:03:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22147993] [2024-11-17 05:03:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22147993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161823290] [2024-11-17 05:03:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:14,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:14,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:14,874 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-17 05:03:14,876 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-17 05:03:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 05:03:15,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:15,133 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-17 05:03:15,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:15,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161823290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:15,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:15,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-17 05:03:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176870339] [2024-11-17 05:03:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 05:03:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:15,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 05:03:15,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 05:03:15,141 INFO L87 Difference]: Start difference. First operand 186 states and 283 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-17 05:03:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:15,310 INFO L93 Difference]: Finished difference Result 414 states and 618 transitions. [2024-11-17 05:03:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 05:03:15,310 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-17 05:03:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:15,312 INFO L225 Difference]: With dead ends: 414 [2024-11-17 05:03:15,312 INFO L226 Difference]: Without dead ends: 245 [2024-11-17 05:03:15,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 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-17 05:03:15,314 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 425 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 734 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-17 05:03:15,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 734 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 05:03:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-17 05:03:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2024-11-17 05:03:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 193 states have (on average 1.4870466321243523) internal successors, (287), 194 states have internal predecessors, (287), 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-17 05:03:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 357 transitions. [2024-11-17 05:03:15,344 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 357 transitions. Word has length 72 [2024-11-17 05:03:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:15,345 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 357 transitions. [2024-11-17 05:03:15,345 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-17 05:03:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 357 transitions. [2024-11-17 05:03:15,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 05:03:15,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:15,350 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] [2024-11-17 05:03:15,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 05:03:15,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:15,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1543628674, now seen corresponding path program 1 times [2024-11-17 05:03:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:15,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726268070] [2024-11-17 05:03:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 05:03:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-17 05:03:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-17 05:03:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 05:03:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-17 05:03:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-17 05:03:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,661 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-17 05:03:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726268070] [2024-11-17 05:03:15,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726268070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223802318] [2024-11-17 05:03:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:15,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:15,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:15,665 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-17 05:03:15,667 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-17 05:03:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:15,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 05:03:15,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:15,870 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-17 05:03:15,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223802318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-17 05:03:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838100796] [2024-11-17 05:03:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:15,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 05:03:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 05:03:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 05:03:15,874 INFO L87 Difference]: Start difference. First operand 240 states and 357 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-17 05:03:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:16,008 INFO L93 Difference]: Finished difference Result 415 states and 618 transitions. [2024-11-17 05:03:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 05:03:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 73 [2024-11-17 05:03:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:16,012 INFO L225 Difference]: With dead ends: 415 [2024-11-17 05:03:16,014 INFO L226 Difference]: Without dead ends: 246 [2024-11-17 05:03:16,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-17 05:03:16,015 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 425 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 734 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-17 05:03:16,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 734 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 05:03:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-17 05:03:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2024-11-17 05:03:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 196 states have (on average 1.4795918367346939) internal successors, (290), 197 states have internal predecessors, (290), 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-17 05:03:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2024-11-17 05:03:16,029 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 73 [2024-11-17 05:03:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:16,029 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2024-11-17 05:03:16,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-17 05:03:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2024-11-17 05:03:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 05:03:16,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:16,031 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, 1] [2024-11-17 05:03:16,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 05:03:16,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-17 05:03:16,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:16,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash 203754950, now seen corresponding path program 1 times [2024-11-17 05:03:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649805183] [2024-11-17 05:03:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 05:03:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-17 05:03:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 05:03:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 05:03:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 05:03:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-17 05:03:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,379 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-17 05:03:16,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649805183] [2024-11-17 05:03:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649805183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537773514] [2024-11-17 05:03:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:16,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:16,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:16,381 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-17 05:03:16,382 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-17 05:03:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 05:03:16,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:16,555 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-17 05:03:16,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537773514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:16,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-17 05:03:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505029864] [2024-11-17 05:03:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:16,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 05:03:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:16,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 05:03:16,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 05:03:16,558 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-17 05:03:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:16,580 INFO L93 Difference]: Finished difference Result 243 states and 360 transitions. [2024-11-17 05:03:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 05:03:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 76 [2024-11-17 05:03:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:16,583 INFO L225 Difference]: With dead ends: 243 [2024-11-17 05:03:16,584 INFO L226 Difference]: Without dead ends: 242 [2024-11-17 05:03:16,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 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-17 05:03:16,585 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 113 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:16,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 659 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:03:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-17 05:03:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-17 05:03:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 196 states have (on average 1.4744897959183674) internal successors, (289), 196 states have internal predecessors, (289), 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-17 05:03:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2024-11-17 05:03:16,604 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 76 [2024-11-17 05:03:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:16,605 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2024-11-17 05:03:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-17 05:03:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2024-11-17 05:03:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 05:03:16,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:16,607 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, 1, 1] [2024-11-17 05:03:16,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 05:03:16,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:16,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2021436169, now seen corresponding path program 1 times [2024-11-17 05:03:16,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:16,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170560652] [2024-11-17 05:03:16,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 05:03:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-17 05:03:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 05:03:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 05:03:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 05:03:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-17 05:03:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:16,934 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-17 05:03:16,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:16,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170560652] [2024-11-17 05:03:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170560652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140018593] [2024-11-17 05:03:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:16,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:16,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:16,936 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-17 05:03:16,937 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-17 05:03:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 05:03:17,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:17,108 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-17 05:03:17,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140018593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:17,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:17,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-17 05:03:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241218920] [2024-11-17 05:03:17,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:17,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 05:03:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 05:03:17,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 05:03:17,111 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-17 05:03:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:17,146 INFO L93 Difference]: Finished difference Result 324 states and 492 transitions. [2024-11-17 05:03:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 05:03:17,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 77 [2024-11-17 05:03:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:17,148 INFO L225 Difference]: With dead ends: 324 [2024-11-17 05:03:17,148 INFO L226 Difference]: Without dead ends: 323 [2024-11-17 05:03:17,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 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-17 05:03:17,149 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 106 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:17,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 826 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:03:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-17 05:03:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2024-11-17 05:03:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 253 states have (on average 1.4782608695652173) internal successors, (374), 253 states have internal predecessors, (374), 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-17 05:03:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 490 transitions. [2024-11-17 05:03:17,166 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 490 transitions. Word has length 77 [2024-11-17 05:03:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:17,167 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 490 transitions. [2024-11-17 05:03:17,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-17 05:03:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 490 transitions. [2024-11-17 05:03:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-17 05:03:17,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:17,171 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:03:17,184 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-17 05:03:17,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:17,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1632499365, now seen corresponding path program 1 times [2024-11-17 05:03:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027215962] [2024-11-17 05:03:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:17,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 05:03:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-17 05:03:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 05:03:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 05:03:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 05:03:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-17 05:03:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-17 05:03:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-17 05:03:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-17 05:03:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-17 05:03:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-17 05:03:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-17 05:03:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-17 05:03:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-17 05:03:17,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027215962] [2024-11-17 05:03:17,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027215962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133758746] [2024-11-17 05:03:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:17,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:17,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:17,564 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-17 05:03:17,565 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-17 05:03:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:17,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 05:03:17,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-17 05:03:17,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 05:03:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-17 05:03:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133758746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 05:03:17,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 05:03:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-17 05:03:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896675202] [2024-11-17 05:03:17,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 05:03:17,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 05:03:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 05:03:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-17 05:03:17,997 INFO L87 Difference]: Start difference. First operand 322 states and 490 transitions. Second operand has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 states have internal predecessors, (187), 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-17 05:03:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:18,210 INFO L93 Difference]: Finished difference Result 754 states and 1154 transitions. [2024-11-17 05:03:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 05:03:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 states have internal predecessors, (187), 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 141 [2024-11-17 05:03:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:18,211 INFO L225 Difference]: With dead ends: 754 [2024-11-17 05:03:18,211 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 05:03:18,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 303 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-17 05:03:18,213 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 796 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:18,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2100 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 05:03:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 05:03:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 05:03:18,214 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-17 05:03:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 05:03:18,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2024-11-17 05:03:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:18,214 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 05:03:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 states have internal predecessors, (187), 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-17 05:03:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 05:03:18,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 05:03:18,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 05:03:18,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 05:03:18,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 05:03:18,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:18,421 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-17 05:03:18,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 05:03:18,887 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:03:18,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:03:18 BoogieIcfgContainer [2024-11-17 05:03:18,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:03:18,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:03:18,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:03:18,906 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:03:18,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:03:14" (3/4) ... [2024-11-17 05:03:18,909 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 05:03:18,911 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history [2024-11-17 05:03:18,911 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure flip_the_side [2024-11-17 05:03:18,911 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history [2024-11-17 05:03:18,912 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-17 05:03:18,912 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history [2024-11-17 05:03:18,912 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-17 05:03:18,912 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_active_side_history [2024-11-17 05:03:18,924 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2024-11-17 05:03:18,925 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-17 05:03:18,925 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 05:03:18,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 05:03:19,050 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 05:03:19,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 05:03:19,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:03:19,052 INFO L158 Benchmark]: Toolchain (without parser) took 6171.73ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 101.8MB in the beginning and 251.1MB in the end (delta: -149.2MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2024-11-17 05:03:19,052 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 157.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:03:19,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.64ms. Allocated memory is still 157.3MB. Free memory was 101.6MB in the beginning and 80.7MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 05:03:19,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.74ms. Allocated memory is still 157.3MB. Free memory was 80.7MB in the beginning and 76.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:03:19,052 INFO L158 Benchmark]: Boogie Preprocessor took 71.15ms. Allocated memory is still 157.3MB. Free memory was 76.7MB in the beginning and 72.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:03:19,053 INFO L158 Benchmark]: IcfgBuilder took 652.77ms. Allocated memory is still 157.3MB. Free memory was 72.5MB in the beginning and 93.7MB in the end (delta: -21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 05:03:19,053 INFO L158 Benchmark]: TraceAbstraction took 4879.28ms. Allocated memory was 157.3MB in the beginning and 243.3MB in the end (delta: 86.0MB). Free memory was 93.2MB in the beginning and 74.1MB in the end (delta: 19.1MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2024-11-17 05:03:19,053 INFO L158 Benchmark]: Witness Printer took 144.94ms. Allocated memory was 243.3MB in the beginning and 293.6MB in the end (delta: 50.3MB). Free memory was 74.1MB in the beginning and 251.1MB in the end (delta: -177.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-17 05:03:19,054 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.81ms. Allocated memory is still 157.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.64ms. Allocated memory is still 157.3MB. Free memory was 101.6MB in the beginning and 80.7MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.74ms. Allocated memory is still 157.3MB. Free memory was 80.7MB in the beginning and 76.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.15ms. Allocated memory is still 157.3MB. Free memory was 76.7MB in the beginning and 72.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 652.77ms. Allocated memory is still 157.3MB. Free memory was 72.5MB in the beginning and 93.7MB in the end (delta: -21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4879.28ms. Allocated memory was 157.3MB in the beginning and 243.3MB in the end (delta: 86.0MB). Free memory was 93.2MB in the beginning and 74.1MB in the end (delta: 19.1MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * Witness Printer took 144.94ms. Allocated memory was 243.3MB in the beginning and 293.6MB in the end (delta: 50.3MB). Free memory was 74.1MB in the beginning and 251.1MB in the end (delta: -177.0MB). Peak memory consumption was 6.5MB. 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, 192 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1967 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1865 mSDsluCounter, 5341 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3730 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 1611 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 717 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred 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, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 950 NumberOfCodeBlocks, 950 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1079 ConstructedInterpolants, 0 QuantifiedInterpolants, 1805 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2520 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 245/333 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]: Location Invariant Derived location invariant: null - 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-17 05:03:19,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE