./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Stockholm-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/Stockholm-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 0690e5781abea147059c8c3687dc0be9b462edcdf26c7ee50864c7e6884a231b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:10:51,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:10:51,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 20:10:51,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:10:51,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:10:51,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:10:51,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:10:51,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:10:51,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:10:51,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:10:51,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:10:51,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:10:51,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:10:51,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:10:51,806 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:10:51,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:10:51,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:10:51,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:10:51,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:10:51,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:10:51,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:10:51,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:10:51,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:10:51,813 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:10:51,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:10:51,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:10:51,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:10:51,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:10:51,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:10:51,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:10:51,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:10:51,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:10:51,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:10:51,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:10:51,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:10:51,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:10:51,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:10:51,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:10:51,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:10:51,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:10:51,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:10:51,817 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0690e5781abea147059c8c3687dc0be9b462edcdf26c7ee50864c7e6884a231b [2024-10-14 20:10:52,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:10:52,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:10:52,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:10:52,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:10:52,123 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:10:52,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Stockholm-1.c [2024-10-14 20:10:53,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:10:53,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:10:53,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Stockholm-1.c [2024-10-14 20:10:53,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0a1893c/8abd22422f7c4b27993474f8fc9f90d6/FLAGe9907af12 [2024-10-14 20:10:54,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0a1893c/8abd22422f7c4b27993474f8fc9f90d6 [2024-10-14 20:10:54,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:10:54,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:10:54,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:10:54,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:10:54,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:10:54,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b5588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54, skipping insertion in model container [2024-10-14 20:10:54,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:10:54,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:10:54,317 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:10:54,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:10:54,345 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:10:54,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54 WrapperNode [2024-10-14 20:10:54,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:10:54,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:10:54,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:10:54,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:10:54,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,371 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2024-10-14 20:10:54,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:10:54,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:10:54,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:10:54,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:10:54,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,386 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 20:10:54,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:10:54,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:10:54,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:10:54,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:10:54,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (1/1) ... [2024-10-14 20:10:54,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:10:54,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:10:54,429 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 20:10:54,431 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 20:10:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:10:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:10:54,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:10:54,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:10:54,686 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 20:10:54,687 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:10:54,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:10:54,706 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:10:54,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:10:54 BoogieIcfgContainer [2024-10-14 20:10:54,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:10:54,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:10:54,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:10:54,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:10:54,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:10:54" (1/3) ... [2024-10-14 20:10:54,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5801745c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:10:54, skipping insertion in model container [2024-10-14 20:10:54,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:10:54" (2/3) ... [2024-10-14 20:10:54,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5801745c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:10:54, skipping insertion in model container [2024-10-14 20:10:54,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:10:54" (3/3) ... [2024-10-14 20:10:54,717 INFO L112 eAbstractionObserver]: Analyzing ICFG Stockholm-1.c [2024-10-14 20:10:54,733 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:10:54,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 20:10:54,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:10:54,791 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;@7d369c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:10:54,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 20:10:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 20 states have internal predecessors, (26), 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 20:10:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:10:54,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:54,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:54,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:54,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash 860374396, now seen corresponding path program 1 times [2024-10-14 20:10:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141017958] [2024-10-14 20:10:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141017958] [2024-10-14 20:10:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141017958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:10:55,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:10:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:10:55,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481987058] [2024-10-14 20:10:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:10:55,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:10:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:10:55,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:10:55,085 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 20 states have internal predecessors, (26), 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 20:10:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:55,190 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-10-14 20:10:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:10:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2024-10-14 20:10:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:55,199 INFO L225 Difference]: With dead ends: 26 [2024-10-14 20:10:55,200 INFO L226 Difference]: Without dead ends: 17 [2024-10-14 20:10:55,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:10:55,205 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:55,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:10:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-14 20:10:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-14 20:10:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 16 states have internal predecessors, (17), 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 20:10:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-10-14 20:10:55,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2024-10-14 20:10:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:55,236 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-10-14 20:10:55,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 20:10:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-10-14 20:10:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:10:55,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:55,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:55,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:10:55,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:55,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash 901802563, now seen corresponding path program 1 times [2024-10-14 20:10:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451570020] [2024-10-14 20:10:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451570020] [2024-10-14 20:10:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451570020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:10:55,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:10:55,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:10:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055807586] [2024-10-14 20:10:55,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:10:55,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:10:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:10:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:10:55,342 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 20:10:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:55,418 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-14 20:10:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:10:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2024-10-14 20:10:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:55,419 INFO L225 Difference]: With dead ends: 25 [2024-10-14 20:10:55,419 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 20:10:55,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:10:55,421 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:55,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:10:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 20:10:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-10-14 20:10:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 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 20:10:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-10-14 20:10:55,430 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 8 [2024-10-14 20:10:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:55,430 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-10-14 20:10:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 20:10:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-10-14 20:10:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 20:10:55,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:55,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:10:55,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2108891554, now seen corresponding path program 1 times [2024-10-14 20:10:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361436058] [2024-10-14 20:10:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361436058] [2024-10-14 20:10:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361436058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:10:55,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:10:55,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:10:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688307143] [2024-10-14 20:10:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:10:55,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:10:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:10:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:10:55,536 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 20:10:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:55,607 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-10-14 20:10:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:10:55,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2024-10-14 20:10:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:55,608 INFO L225 Difference]: With dead ends: 20 [2024-10-14 20:10:55,609 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 20:10:55,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:10:55,612 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:55,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:10:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 20:10:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 20:10:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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 20:10:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-10-14 20:10:55,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2024-10-14 20:10:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:55,623 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-10-14 20:10:55,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 20:10:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-10-14 20:10:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:10:55,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:55,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:55,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:10:55,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:55,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash -951128667, now seen corresponding path program 1 times [2024-10-14 20:10:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087575157] [2024-10-14 20:10:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087575157] [2024-10-14 20:10:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087575157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:10:55,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:10:55,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:10:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637994932] [2024-10-14 20:10:55,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:10:55,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:10:55,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:55,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:10:55,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:10:55,729 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 20:10:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:55,803 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-10-14 20:10:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:10:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2024-10-14 20:10:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:55,804 INFO L225 Difference]: With dead ends: 24 [2024-10-14 20:10:55,804 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 20:10:55,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:10:55,806 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:55,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:10:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 20:10:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 20:10:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 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 20:10:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-10-14 20:10:55,818 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 10 [2024-10-14 20:10:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:55,818 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-10-14 20:10:55,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 20:10:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-10-14 20:10:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:10:55,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:55,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:55,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:10:55,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:55,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 595219126, now seen corresponding path program 1 times [2024-10-14 20:10:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:55,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989526382] [2024-10-14 20:10:55,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:55,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989526382] [2024-10-14 20:10:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989526382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:10:55,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337279427] [2024-10-14 20:10:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:55,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:55,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:10:55,943 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 20:10:55,947 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 20:10:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:55,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:10:55,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:10:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:56,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:10:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337279427] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:10:56,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:10:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-14 20:10:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121328155] [2024-10-14 20:10:56,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:10:56,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 20:10:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 20:10:56,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:10:56,367 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 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 20:10:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:56,514 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-10-14 20:10:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:10:56,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 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) Word has length 15 [2024-10-14 20:10:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:56,515 INFO L225 Difference]: With dead ends: 33 [2024-10-14 20:10:56,515 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 20:10:56,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 20:10:56,517 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:56,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:10:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 20:10:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 20:10:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 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 20:10:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-14 20:10:56,527 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2024-10-14 20:10:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:56,527 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-14 20:10:56,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 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 20:10:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-14 20:10:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 20:10:56,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:56,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:56,547 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 20:10:56,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:56,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:56,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 774931800, now seen corresponding path program 1 times [2024-10-14 20:10:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:56,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225402908] [2024-10-14 20:10:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225402908] [2024-10-14 20:10:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225402908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:10:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945562773] [2024-10-14 20:10:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:56,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:56,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:10:56,825 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 20:10:56,829 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 20:10:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:56,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:10:56,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:10:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:57,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:10:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:57,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945562773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:10:57,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:10:57,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-14 20:10:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581338086] [2024-10-14 20:10:57,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:10:57,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 20:10:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 20:10:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:10:57,106 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 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 20:10:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:57,217 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-10-14 20:10:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:10:57,218 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 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) Word has length 17 [2024-10-14 20:10:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:57,219 INFO L225 Difference]: With dead ends: 35 [2024-10-14 20:10:57,219 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 20:10:57,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:10:57,221 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:57,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:10:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 20:10:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-14 20:10:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 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 20:10:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-10-14 20:10:57,231 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 17 [2024-10-14 20:10:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:57,232 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-10-14 20:10:57,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 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 20:10:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-10-14 20:10:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 20:10:57,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:57,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:57,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:10:57,435 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,SelfDestructingSolverStorable5 [2024-10-14 20:10:57,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:57,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash -364431850, now seen corresponding path program 2 times [2024-10-14 20:10:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453920564] [2024-10-14 20:10:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453920564] [2024-10-14 20:10:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453920564] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:10:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911113137] [2024-10-14 20:10:57,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:10:57,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:57,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:10:57,568 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 20:10:57,570 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 20:10:57,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:10:57,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:10:57,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:10:57,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:10:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:57,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:10:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911113137] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:10:58,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:10:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-14 20:10:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533822247] [2024-10-14 20:10:58,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:10:58,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 20:10:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 20:10:58,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-10-14 20:10:58,052 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 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 20:10:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:58,213 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-10-14 20:10:58,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 20:10:58,214 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 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) Word has length 29 [2024-10-14 20:10:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:58,215 INFO L225 Difference]: With dead ends: 43 [2024-10-14 20:10:58,215 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 20:10:58,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-10-14 20:10:58,216 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:58,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:10:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 20:10:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-14 20:10:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 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 20:10:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-10-14 20:10:58,228 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 29 [2024-10-14 20:10:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:58,228 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-10-14 20:10:58,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 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 20:10:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-10-14 20:10:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 20:10:58,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:58,230 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:58,247 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 20:10:58,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:58,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1968312504, now seen corresponding path program 2 times [2024-10-14 20:10:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065038167] [2024-10-14 20:10:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065038167] [2024-10-14 20:10:58,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065038167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:10:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064382931] [2024-10-14 20:10:58,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:10:58,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:58,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:10:58,535 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 20:10:58,536 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 20:10:58,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:10:58,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:10:58,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:10:58,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:10:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:58,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:10:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064382931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:10:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:10:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-14 20:10:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744852148] [2024-10-14 20:10:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:10:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:10:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:10:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:10:58,742 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 20:10:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:58,795 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2024-10-14 20:10:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:10:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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) Word has length 31 [2024-10-14 20:10:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:58,799 INFO L225 Difference]: With dead ends: 38 [2024-10-14 20:10:58,799 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 20:10:58,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:10:58,800 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:58,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:10:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 20:10:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 20:10:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 20:10:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-10-14 20:10:58,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2024-10-14 20:10:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:58,811 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2024-10-14 20:10:58,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 20:10:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-10-14 20:10:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 20:10:58,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:10:58,812 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-14 20:10:58,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:10:59,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:59,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:10:59,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:10:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1721687165, now seen corresponding path program 3 times [2024-10-14 20:10:59,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:10:59,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680425168] [2024-10-14 20:10:59,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:10:59,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:10:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:10:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:10:59,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:10:59,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680425168] [2024-10-14 20:10:59,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680425168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:10:59,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095380817] [2024-10-14 20:10:59,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:10:59,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:10:59,151 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 20:10:59,153 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 20:10:59,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 20:10:59,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:10:59,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:10:59,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:10:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 20:10:59,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:10:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 20:10:59,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095380817] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:10:59,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:10:59,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 14 [2024-10-14 20:10:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441095318] [2024-10-14 20:10:59,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:10:59,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 20:10:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:10:59,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 20:10:59,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 20:10:59,360 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 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 20:10:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:10:59,557 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-10-14 20:10:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 20:10:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 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) Word has length 36 [2024-10-14 20:10:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:10:59,558 INFO L225 Difference]: With dead ends: 41 [2024-10-14 20:10:59,558 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:10:59,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2024-10-14 20:10:59,559 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:10:59,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:10:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:10:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:10:59,560 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 20:10:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:10:59,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-10-14 20:10:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:10:59,561 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:10:59,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 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 20:10:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:10:59,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:10:59,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-14 20:10:59,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-14 20:10:59,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-14 20:10:59,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-14 20:10:59,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-14 20:10:59,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-14 20:10:59,580 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 20:10:59,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:10:59,771 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-14 20:10:59,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:10:59,859 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:10:59,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:10:59 BoogieIcfgContainer [2024-10-14 20:10:59,879 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:10:59,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:10:59,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:10:59,880 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:10:59,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:10:54" (3/4) ... [2024-10-14 20:10:59,883 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:10:59,889 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 20:10:59,890 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:10:59,890 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:10:59,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:10:59,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:10:59,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:10:59,978 INFO L158 Benchmark]: Toolchain (without parser) took 5854.51ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 100.1MB in the beginning and 101.5MB in the end (delta: -1.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-10-14 20:10:59,978 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:10:59,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.66ms. Allocated memory is still 144.7MB. Free memory was 99.5MB in the beginning and 89.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:10:59,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.37ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 88.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:10:59,979 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 144.7MB. Free memory was 88.0MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:10:59,979 INFO L158 Benchmark]: RCFGBuilder took 312.68ms. Allocated memory is still 144.7MB. Free memory was 86.4MB in the beginning and 110.8MB in the end (delta: -24.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:10:59,979 INFO L158 Benchmark]: TraceAbstraction took 5170.01ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 109.7MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-10-14 20:10:59,980 INFO L158 Benchmark]: Witness Printer took 97.72ms. Allocated memory is still 192.9MB. Free memory was 106.6MB in the beginning and 101.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:10:59,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.66ms. Allocated memory is still 144.7MB. Free memory was 99.5MB in the beginning and 89.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.37ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 88.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.49ms. Allocated memory is still 144.7MB. Free memory was 88.0MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.68ms. Allocated memory is still 144.7MB. Free memory was 86.4MB in the beginning and 110.8MB in the end (delta: -24.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5170.01ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 109.7MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Witness Printer took 97.72ms. Allocated memory is still 192.9MB. Free memory was 106.6MB in the beginning and 101.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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 1 procedures, 21 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 855 IncrementalHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 44 mSDtfsCounter, 855 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=7, InterpolantAutomatonStates: 58, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 290 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 3034 SizeOfPredicates, 10 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 108/348 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 6 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((((long) 3 * b) + x) <= (268435452 + ((long) 3 * a))) && (0 <= ((long) 268435455 + a))) && (b <= ((long) 536870910 + a))) && (((long) a + x) <= 536870906)) && (a <= b)) || (((((a <= 268435455) && (0 <= ((long) 268435455 + a))) && (b <= ((long) 536870910 + a))) && (a <= b)) && (x <= 268435455))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:11:00,007 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