./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:17:06,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:17:06,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:17:06,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:17:06,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:17:06,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:17:06,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:17:06,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:17:06,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:17:06,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:17:06,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:17:06,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:17:06,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:17:06,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:17:06,123 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:17:06,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:17:06,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:17:06,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:17:06,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:17:06,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:17:06,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:17:06,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:17:06,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:17:06,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:17:06,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:17:06,131 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:17:06,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:17:06,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:17:06,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:17:06,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:17:06,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:17:06,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:17:06,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:17:06,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:17:06,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:06,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:17:06,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:17:06,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:17:06,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:17:06,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:17:06,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:17:06,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:17:06,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:17:06,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:17:06,134 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-10-14 21:17:06,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:17:06,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:17:06,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:17:06,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:17:06,380 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:17:06,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-10-14 21:17:07,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:17:07,828 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:17:07,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-10-14 21:17:07,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31ebfeec/e64771ccf68d41ed852ac1f2e91f4f3a/FLAG1ec16085c [2024-10-14 21:17:07,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31ebfeec/e64771ccf68d41ed852ac1f2e91f4f3a [2024-10-14 21:17:07,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:17:07,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:17:07,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:07,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:17:07,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:17:07,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:07" (1/1) ... [2024-10-14 21:17:07,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb325f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:07, skipping insertion in model container [2024-10-14 21:17:07,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:07" (1/1) ... [2024-10-14 21:17:07,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:17:08,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:08,140 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:17:08,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:08,197 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:17:08,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08 WrapperNode [2024-10-14 21:17:08,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:08,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:08,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:17:08,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:17:08,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,255 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 518 [2024-10-14 21:17:08,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:08,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:17:08,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:17:08,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:17:08,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,306 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 21:17:08,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:17:08,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:17:08,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:17:08,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:17:08,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (1/1) ... [2024-10-14 21:17:08,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:08,374 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-10-14 21:17:08,377 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-10-14 21:17:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-14 21:17:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-14 21:17:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:17:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-14 21:17:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-14 21:17:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-14 21:17:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-14 21:17:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-14 21:17:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-14 21:17:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 21:17:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 21:17:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:17:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-14 21:17:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-14 21:17:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:17:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:17:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-14 21:17:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-14 21:17:08,523 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:17:08,525 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:17:09,079 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-14 21:17:09,080 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:17:09,135 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:17:09,135 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 21:17:09,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:09 BoogieIcfgContainer [2024-10-14 21:17:09,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:17:09,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:17:09,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:17:09,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:17:09,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:17:07" (1/3) ... [2024-10-14 21:17:09,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e25a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:09, skipping insertion in model container [2024-10-14 21:17:09,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:08" (2/3) ... [2024-10-14 21:17:09,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e25a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:09, skipping insertion in model container [2024-10-14 21:17:09,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:09" (3/3) ... [2024-10-14 21:17:09,145 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-10-14 21:17:09,159 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:17:09,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 21:17:09,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:17:09,231 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;@626edaa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:17:09,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 21:17:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 132 states have (on average 1.5984848484848484) internal successors, (211), 134 states have internal predecessors, (211), 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-10-14 21:17:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 21:17:09,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:09,253 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] [2024-10-14 21:17:09,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:17:09,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519119, now seen corresponding path program 1 times [2024-10-14 21:17:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:09,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514316604] [2024-10-14 21:17:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:17:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 21:17:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 21:17:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 21:17:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 21:17:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 21:17:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 21:17:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:17:09,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514316604] [2024-10-14 21:17:09,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514316604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:09,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:09,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:17:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174399063] [2024-10-14 21:17:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:09,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 21:17:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 21:17:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:17:09,630 INFO L87 Difference]: Start difference. First operand has 173 states, 132 states have (on average 1.5984848484848484) internal successors, (211), 134 states have internal predecessors, (211), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-10-14 21:17:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:09,685 INFO L93 Difference]: Finished difference Result 331 states and 547 transitions. [2024-10-14 21:17:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 21:17:09,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 64 [2024-10-14 21:17:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:09,703 INFO L225 Difference]: With dead ends: 331 [2024-10-14 21:17:09,704 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 21:17:09,708 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-10-14 21:17:09,714 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:09,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 21:17:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-14 21:17:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 132 states have internal predecessors, (206), 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-10-14 21:17:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 268 transitions. [2024-10-14 21:17:09,758 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 268 transitions. Word has length 64 [2024-10-14 21:17:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:09,759 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 268 transitions. [2024-10-14 21:17:09,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-10-14 21:17:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 268 transitions. [2024-10-14 21:17:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 21:17:09,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:09,762 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] [2024-10-14 21:17:09,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:17:09,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:17:09,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 202851731, now seen corresponding path program 1 times [2024-10-14 21:17:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:09,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480469030] [2024-10-14 21:17:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:17:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 21:17:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 21:17:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 21:17:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 21:17:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 21:17:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 21:17:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 21:17:10,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:10,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480469030] [2024-10-14 21:17:10,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480469030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:10,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426868638] [2024-10-14 21:17:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:10,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:10,115 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-10-14 21:17:10,117 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-10-14 21:17:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:10,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:17:10,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426868638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:10,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:10,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-14 21:17:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856237886] [2024-10-14 21:17:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:17:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:10,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:17:10,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:10,376 INFO L87 Difference]: Start difference. First operand 171 states and 268 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-10-14 21:17:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:10,542 INFO L93 Difference]: Finished difference Result 372 states and 576 transitions. [2024-10-14 21:17:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 64 [2024-10-14 21:17:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:10,545 INFO L225 Difference]: With dead ends: 372 [2024-10-14 21:17:10,545 INFO L226 Difference]: Without dead ends: 217 [2024-10-14 21:17:10,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 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-10-14 21:17:10,550 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 384 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:10,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 690 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-14 21:17:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2024-10-14 21:17:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 169 states have internal predecessors, (262), 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-10-14 21:17:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 332 transitions. [2024-10-14 21:17:10,571 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 332 transitions. Word has length 64 [2024-10-14 21:17:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:10,571 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 332 transitions. [2024-10-14 21:17:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-10-14 21:17:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 332 transitions. [2024-10-14 21:17:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 21:17:10,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:10,574 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] [2024-10-14 21:17:10,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 21:17:10,775 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-10-14 21:17:10,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:17:10,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash 888124015, now seen corresponding path program 1 times [2024-10-14 21:17:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66218668] [2024-10-14 21:17:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:17:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:17:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 21:17:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:17:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 21:17:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 21:17:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 21:17:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 21:17:10,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:10,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66218668] [2024-10-14 21:17:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66218668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:10,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229058101] [2024-10-14 21:17:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:10,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:10,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:10,970 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-10-14 21:17:10,971 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-10-14 21:17:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:11,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:17:11,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229058101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:11,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-14 21:17:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091207261] [2024-10-14 21:17:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:11,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:17:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:11,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:17:11,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:11,140 INFO L87 Difference]: Start difference. First operand 215 states and 332 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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-10-14 21:17:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:11,287 INFO L93 Difference]: Finished difference Result 373 states and 576 transitions. [2024-10-14 21:17:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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 65 [2024-10-14 21:17:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:11,289 INFO L225 Difference]: With dead ends: 373 [2024-10-14 21:17:11,289 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 21:17:11,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 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-10-14 21:17:11,291 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 384 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:11,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 690 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 21:17:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2024-10-14 21:17:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 170 states have (on average 1.5529411764705883) internal successors, (264), 171 states have internal predecessors, (264), 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-10-14 21:17:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 334 transitions. [2024-10-14 21:17:11,304 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 334 transitions. Word has length 65 [2024-10-14 21:17:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:11,305 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 334 transitions. [2024-10-14 21:17:11,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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-10-14 21:17:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 334 transitions. [2024-10-14 21:17:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 21:17:11,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:11,307 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] [2024-10-14 21:17:11,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:11,510 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-10-14 21:17:11,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:17:11,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash 697576641, now seen corresponding path program 1 times [2024-10-14 21:17:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:11,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693883907] [2024-10-14 21:17:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:17:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 21:17:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:17:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:17:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:17:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:17:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 21:17:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693883907] [2024-10-14 21:17:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693883907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361058119] [2024-10-14 21:17:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:11,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:11,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:11,638 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-10-14 21:17:11,640 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-10-14 21:17:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:11,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:11,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:17:11,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361058119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:11,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:11,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-14 21:17:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210842696] [2024-10-14 21:17:11,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:11,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:11,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:11,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:17:11,819 INFO L87 Difference]: Start difference. First operand 217 states and 334 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 21:17:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:11,860 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2024-10-14 21:17:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 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 67 [2024-10-14 21:17:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:11,864 INFO L225 Difference]: With dead ends: 217 [2024-10-14 21:17:11,864 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 21:17:11,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 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-10-14 21:17:11,866 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 108 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:11,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 621 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 21:17:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-14 21:17:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 170 states have (on average 1.5470588235294118) internal successors, (263), 170 states have internal predecessors, (263), 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-10-14 21:17:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 333 transitions. [2024-10-14 21:17:11,892 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 333 transitions. Word has length 67 [2024-10-14 21:17:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:11,892 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 333 transitions. [2024-10-14 21:17:11,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 21:17:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 333 transitions. [2024-10-14 21:17:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 21:17:11,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:11,894 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] [2024-10-14 21:17:11,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 21:17:12,094 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-10-14 21:17:12,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:17:12,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash 150039915, now seen corresponding path program 1 times [2024-10-14 21:17:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426705854] [2024-10-14 21:17:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:17:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 21:17:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:17:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:17:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:17:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:17:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 21:17:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:12,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426705854] [2024-10-14 21:17:12,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426705854] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:12,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019090456] [2024-10-14 21:17:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:12,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:12,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:12,254 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-10-14 21:17:12,255 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-10-14 21:17:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:12,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 21:17:12,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:12,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019090456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:12,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-14 21:17:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498417635] [2024-10-14 21:17:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:12,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:12,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:17:12,414 INFO L87 Difference]: Start difference. First operand 216 states and 333 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-10-14 21:17:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:12,457 INFO L93 Difference]: Finished difference Result 295 states and 463 transitions. [2024-10-14 21:17:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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 68 [2024-10-14 21:17:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:12,460 INFO L225 Difference]: With dead ends: 295 [2024-10-14 21:17:12,460 INFO L226 Difference]: Without dead ends: 294 [2024-10-14 21:17:12,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 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-10-14 21:17:12,461 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 101 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:12,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 774 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-14 21:17:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-10-14 21:17:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 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-10-14 21:17:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2024-10-14 21:17:12,478 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 462 transitions. Word has length 68 [2024-10-14 21:17:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-10-14 21:17:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-10-14 21:17:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 462 transitions. [2024-10-14 21:17:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 21:17:12,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:12,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:12,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:12,687 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-10-14 21:17:12,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:17:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1646856766, now seen corresponding path program 1 times [2024-10-14 21:17:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317202661] [2024-10-14 21:17:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 21:17:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 21:17:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:17:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:17:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:17:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:17:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 21:17:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 21:17:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 21:17:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 21:17:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 21:17:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 21:17:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 21:17:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-14 21:17:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317202661] [2024-10-14 21:17:12,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317202661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634256544] [2024-10-14 21:17:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:12,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:12,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:12,861 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-10-14 21:17:12,862 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-10-14 21:17:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:12,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:17:12,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 21:17:13,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 21:17:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634256544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:13,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-10-14 21:17:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412919078] [2024-10-14 21:17:13,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:13,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 21:17:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 21:17:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:17:13,266 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. Second operand has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 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-10-14 21:17:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:13,479 INFO L93 Difference]: Finished difference Result 684 states and 1084 transitions. [2024-10-14 21:17:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 21:17:13,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 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 124 [2024-10-14 21:17:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:13,480 INFO L225 Difference]: With dead ends: 684 [2024-10-14 21:17:13,480 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:17:13,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 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-10-14 21:17:13,482 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 647 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:13,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1960 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:17:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:17:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:17:13,483 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-10-14 21:17:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:17:13,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-10-14 21:17:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:13,484 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:17:13,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 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-10-14 21:17:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:17:13,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:17:13,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 21:17:13,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 21:17:13,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:17:13,687 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-10-14 21:17:13,691 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 21:17:13,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:17:14,206 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:17:14,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:17:14 BoogieIcfgContainer [2024-10-14 21:17:14,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:17:14,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:17:14,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:17:14,233 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:17:14,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:09" (3/4) ... [2024-10-14 21:17:14,236 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:17:14,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history [2024-10-14 21:17:14,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure flip_the_side [2024-10-14 21:17:14,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history [2024-10-14 21:17:14,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-10-14 21:17:14,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history [2024-10-14 21:17:14,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 21:17:14,240 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_active_side_history [2024-10-14 21:17:14,256 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-10-14 21:17:14,259 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 21:17:14,260 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:17:14,260 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:17:14,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:17:14,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:17:14,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:17:14,385 INFO L158 Benchmark]: Toolchain (without parser) took 6530.90ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 134.2MB in the beginning and 139.8MB in the end (delta: -5.6MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-10-14 21:17:14,386 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 102.8MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:17:14,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.35ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 114.7MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 21:17:14,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.51ms. Allocated memory is still 178.3MB. Free memory was 114.7MB in the beginning and 110.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:17:14,386 INFO L158 Benchmark]: Boogie Preprocessor took 83.12ms. Allocated memory is still 178.3MB. Free memory was 110.8MB in the beginning and 106.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:17:14,387 INFO L158 Benchmark]: RCFGBuilder took 795.52ms. Allocated memory is still 178.3MB. Free memory was 106.3MB in the beginning and 105.5MB in the end (delta: 816.5kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 21:17:14,387 INFO L158 Benchmark]: TraceAbstraction took 5095.57ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 104.5MB in the beginning and 152.4MB in the end (delta: -47.9MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2024-10-14 21:17:14,387 INFO L158 Benchmark]: Witness Printer took 151.57ms. Allocated memory is still 232.8MB. Free memory was 152.4MB in the beginning and 139.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 21:17:14,389 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.89ms. Allocated memory is still 102.8MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.35ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 114.7MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.51ms. Allocated memory is still 178.3MB. Free memory was 114.7MB in the beginning and 110.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.12ms. Allocated memory is still 178.3MB. Free memory was 110.8MB in the beginning and 106.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 795.52ms. Allocated memory is still 178.3MB. Free memory was 106.3MB in the beginning and 105.5MB in the end (delta: 816.5kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5095.57ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 104.5MB in the beginning and 152.4MB in the end (delta: -47.9MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * Witness Printer took 151.57ms. Allocated memory is still 232.8MB. Free memory was 152.4MB in the beginning and 139.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 173 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1726 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1624 mSDsluCounter, 4999 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3498 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 1501 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred 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, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2119 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 238/312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((0 <= i2) && (i2 <= 2147483646)) && (((short) nomsg + 1) <= 0)) - ProcedureContractResult [Line: 173]: Procedure Contract for read_manual_selection_history Derived contract for procedure read_manual_selection_history. Requires: (((short) nomsg + 1) <= 0) Ensures: (((short) nomsg + 1) <= 0) - 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) - 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) - ProcedureContractResult [Line: 612]: Procedure Contract for assert Derived contract for procedure assert. Requires: (((short) nomsg + 1) <= 0) Ensures: (((short) nomsg + 1) <= 0) - 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) - 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)) - 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) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:17:14,413 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