./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/java_Nested.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/java_Nested.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 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:52:57,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:52:57,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 16:52:57,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:52:57,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:52:57,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:52:57,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:52:57,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:52:57,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:52:57,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:52:57,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:52:57,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:52:57,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:52:57,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:52:57,362 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:52:57,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:52:57,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:52:57,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:52:57,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:52:57,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:52:57,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:52:57,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:52:57,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:52:57,368 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:52:57,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:52:57,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:52:57,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:52:57,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:52:57,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:52:57,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:52:57,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:52:57,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:52:57,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:52:57,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:52:57,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:52:57,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:52:57,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:52:57,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:52:57,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:52:57,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:52:57,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:52:57,374 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 -> 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 [2024-11-12 16:52:57,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:52:57,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:52:57,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:52:57,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:52:57,660 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:52:57,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-11-12 16:52:59,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:52:59,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:52:59,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-11-12 16:52:59,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cb94562/4668435f53794577acc023912f09fbd4/FLAGf8cecd13e [2024-11-12 16:52:59,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cb94562/4668435f53794577acc023912f09fbd4 [2024-11-12 16:52:59,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:52:59,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:52:59,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:52:59,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:52:59,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:52:59,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709ad207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59, skipping insertion in model container [2024-11-12 16:52:59,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:52:59,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:52:59,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:52:59,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:52:59,548 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:52:59,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59 WrapperNode [2024-11-12 16:52:59,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:52:59,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:52:59,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:52:59,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:52:59,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,576 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2024-11-12 16:52:59,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:52:59,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:52:59,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:52:59,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:52:59,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,598 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 16:52:59,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:52:59,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:52:59,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:52:59,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:52:59,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (1/1) ... [2024-11-12 16:52:59,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:52:59,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:52:59,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:52:59,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:52:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:52:59,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:52:59,775 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:52:59,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:52:59,935 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 16:52:59,936 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:52:59,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:52:59,966 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:52:59,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:59 BoogieIcfgContainer [2024-11-12 16:52:59,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:52:59,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:52:59,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:52:59,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:52:59,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:52:59" (1/3) ... [2024-11-12 16:52:59,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2cfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:59, skipping insertion in model container [2024-11-12 16:53:00,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:59" (2/3) ... [2024-11-12 16:53:00,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2cfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:53:00, skipping insertion in model container [2024-11-12 16:53:00,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:59" (3/3) ... [2024-11-12 16:53:00,002 INFO L112 eAbstractionObserver]: Analyzing ICFG java_Nested.c [2024-11-12 16:53:00,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:53:00,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 16:53:00,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:53:00,100 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;@2f0f5ff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:53:00,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 16:53:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 16:53:00,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 16:53:00,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,114 INFO L85 PathProgramCache]: Analyzing trace with hash 28699898, now seen corresponding path program 1 times [2024-11-12 16:53:00,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757487221] [2024-11-12 16:53:00,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757487221] [2024-11-12 16:53:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757487221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:53:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926850766] [2024-11-12 16:53:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:00,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,286 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 states have internal predecessors, (27), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,341 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-11-12 16:53:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:00,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-12 16:53:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,349 INFO L225 Difference]: With dead ends: 55 [2024-11-12 16:53:00,349 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 16:53:00,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,355 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 16:53:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-12 16:53:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-12 16:53:00,384 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 5 [2024-11-12 16:53:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:00,384 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-12 16:53:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-12 16:53:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 16:53:00,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 16:53:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:53:00,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2024-11-12 16:53:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069257472] [2024-11-12 16:53:00,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069257472] [2024-11-12 16:53:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069257472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:53:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459929918] [2024-11-12 16:53:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,428 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,462 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-12 16:53:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-12 16:53:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,463 INFO L225 Difference]: With dead ends: 28 [2024-11-12 16:53:00,463 INFO L226 Difference]: Without dead ends: 27 [2024-11-12 16:53:00,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,465 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-12 16:53:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-12 16:53:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.631578947368421) internal successors, (31), 26 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-11-12 16:53:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-12 16:53:00,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2024-11-12 16:53:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:00,470 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-12 16:53:00,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-12 16:53:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 16:53:00,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:00,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:53:00,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1810845099, now seen corresponding path program 1 times [2024-11-12 16:53:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275037544] [2024-11-12 16:53:00,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275037544] [2024-11-12 16:53:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275037544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:53:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794641025] [2024-11-12 16:53:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:00,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,512 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11-12 16:53:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,526 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-11-12 16:53:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:00,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11-12 16:53:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,528 INFO L225 Difference]: With dead ends: 27 [2024-11-12 16:53:00,529 INFO L226 Difference]: Without dead ends: 26 [2024-11-12 16:53:00,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,530 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-12 16:53:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-12 16:53:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-12 16:53:00,535 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2024-11-12 16:53:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:00,535 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-12 16:53:00,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11-12 16:53:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-12 16:53:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 16:53:00,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:00,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:53:00,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash 301623279, now seen corresponding path program 1 times [2024-11-12 16:53:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292458418] [2024-11-12 16:53:00,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:00,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292458418] [2024-11-12 16:53:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292458418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:53:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326836950] [2024-11-12 16:53:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,576 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-11-12 16:53:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,585 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-12 16:53:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:00,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-11-12 16:53:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,587 INFO L225 Difference]: With dead ends: 33 [2024-11-12 16:53:00,587 INFO L226 Difference]: Without dead ends: 32 [2024-11-12 16:53:00,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,588 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-12 16:53:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-12 16:53:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-12 16:53:00,594 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 8 [2024-11-12 16:53:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:00,595 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-12 16:53:00,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-11-12 16:53:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-12 16:53:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:53:00,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:00,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:53:00,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash 760387117, now seen corresponding path program 1 times [2024-11-12 16:53:00,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66220947] [2024-11-12 16:53:00,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:00,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66220947] [2024-11-12 16:53:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66220947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:53:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503182991] [2024-11-12 16:53:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:53:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:53:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:53:00,677 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-12 16:53:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,709 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-12 16:53:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:53:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-12 16:53:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,711 INFO L225 Difference]: With dead ends: 32 [2024-11-12 16:53:00,713 INFO L226 Difference]: Without dead ends: 30 [2024-11-12 16:53:00,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:53:00,714 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-12 16:53:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-12 16:53:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-12 16:53:00,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 9 [2024-11-12 16:53:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:00,722 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-12 16:53:00,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-12 16:53:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-12 16:53:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 16:53:00,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:00,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:53:00,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1035144580, now seen corresponding path program 1 times [2024-11-12 16:53:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641430642] [2024-11-12 16:53:00,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:53:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641430642] [2024-11-12 16:53:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641430642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:53:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556097758] [2024-11-12 16:53:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:00,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,782 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,793 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-12 16:53:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-12 16:53:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,796 INFO L225 Difference]: With dead ends: 30 [2024-11-12 16:53:00,797 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 16:53:00,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,799 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 16:53:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-12 16:53:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 28 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-11-12 16:53:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-12 16:53:00,812 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 12 [2024-11-12 16:53:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:00,812 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-12 16:53:00,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-12 16:53:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 16:53:00,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:53:00,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2024710977, now seen corresponding path program 1 times [2024-11-12 16:53:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760547750] [2024-11-12 16:53:00,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:53:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760547750] [2024-11-12 16:53:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760547750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:53:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251265068] [2024-11-12 16:53:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:00,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,880 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,896 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-12 16:53:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:00,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-12 16:53:00,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,897 INFO L225 Difference]: With dead ends: 44 [2024-11-12 16:53:00,899 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 16:53:00,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,900 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 16:53:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-12 16:53:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-12 16:53:00,913 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 13 [2024-11-12 16:53:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:00,914 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-12 16:53:00,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-12 16:53:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 16:53:00,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:00,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:00,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:53:00,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:00,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2024712419, now seen corresponding path program 1 times [2024-11-12 16:53:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:00,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269488431] [2024-11-12 16:53:00,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:53:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:00,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269488431] [2024-11-12 16:53:00,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269488431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:00,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:00,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:53:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095519088] [2024-11-12 16:53:00,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:00,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:00,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,966 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:00,986 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-12 16:53:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:00,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-12 16:53:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:00,990 INFO L225 Difference]: With dead ends: 40 [2024-11-12 16:53:00,991 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 16:53:00,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:00,993 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:00,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 16:53:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-11-12 16:53:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 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-11-12 16:53:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-12 16:53:01,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2024-11-12 16:53:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:01,001 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-12 16:53:01,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-12 16:53:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:53:01,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:01,002 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:01,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:53:01,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:01,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash 128451365, now seen corresponding path program 1 times [2024-11-12 16:53:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76805880] [2024-11-12 16:53:01,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:01,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76805880] [2024-11-12 16:53:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76805880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831821580] [2024-11-12 16:53:01,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:01,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:01,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 16:53:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:01,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:53:01,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:01,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:53:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831821580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:53:01,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:53:01,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-12 16:53:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752396365] [2024-11-12 16:53:01,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:53:01,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:53:01,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:01,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:53:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:53:01,226 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:01,266 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-11-12 16:53:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:53:01,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-11-12 16:53:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:01,268 INFO L225 Difference]: With dead ends: 88 [2024-11-12 16:53:01,268 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 16:53:01,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:53:01,269 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:01,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 16:53:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-12 16:53:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.144578313253012) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-11-12 16:53:01,282 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 15 [2024-11-12 16:53:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-11-12 16:53:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-11-12 16:53:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:53:01,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:01,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 16:53:01,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 16:53:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:01,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:01,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1911050654, now seen corresponding path program 1 times [2024-11-12 16:53:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:01,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006532218] [2024-11-12 16:53:01,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:01,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 16:53:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:01,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006532218] [2024-11-12 16:53:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006532218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:53:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:53:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458713724] [2024-11-12 16:53:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:01,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:53:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:53:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:01,524 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:01,541 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-11-12 16:53:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:53:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-11-12 16:53:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:01,545 INFO L225 Difference]: With dead ends: 85 [2024-11-12 16:53:01,545 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 16:53:01,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:53:01,546 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:01,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 16:53:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2024-11-12 16:53:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-11-12 16:53:01,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 24 [2024-11-12 16:53:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:01,563 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-12 16:53:01,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-12 16:53:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 16:53:01,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:01,565 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-12 16:53:01,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:53:01,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:01,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1983309423, now seen corresponding path program 2 times [2024-11-12 16:53:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141632943] [2024-11-12 16:53:01,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141632943] [2024-11-12 16:53:01,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141632943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347738834] [2024-11-12 16:53:01,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:53:01,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:01,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:01,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 16:53:01,765 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:53:01,765 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:53:01,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:53:01,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:01,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:53:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:01,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347738834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:53:01,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:53:01,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-12 16:53:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442654896] [2024-11-12 16:53:01,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:53:01,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:53:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:01,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:53:01,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:53:01,992 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 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-11-12 16:53:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:02,057 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2024-11-12 16:53:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:53:02,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 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-11-12 16:53:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:02,059 INFO L225 Difference]: With dead ends: 120 [2024-11-12 16:53:02,059 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 16:53:02,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:53:02,060 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:02,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 16:53:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-12 16:53:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0932203389830508) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-12 16:53:02,074 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 36 [2024-11-12 16:53:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:02,075 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-12 16:53:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 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-11-12 16:53:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-12 16:53:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 16:53:02,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:02,077 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2024-11-12 16:53:02,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 16:53:02,277 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,SelfDestructingSolverStorable10 [2024-11-12 16:53:02,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:02,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1790508079, now seen corresponding path program 3 times [2024-11-12 16:53:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:02,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955986478] [2024-11-12 16:53:02,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:02,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955986478] [2024-11-12 16:53:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955986478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285939930] [2024-11-12 16:53:02,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:53:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:02,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:02,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:53:02,602 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-12 16:53:02,603 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:53:02,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 16:53:02,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:53:02,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:53:02,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285939930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:02,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:53:02,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 25 [2024-11-12 16:53:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894162931] [2024-11-12 16:53:02,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:02,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:53:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:53:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-11-12 16:53:02,900 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:03,058 INFO L93 Difference]: Finished difference Result 483 states and 538 transitions. [2024-11-12 16:53:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 16:53:03,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 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 78 [2024-11-12 16:53:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:03,062 INFO L225 Difference]: With dead ends: 483 [2024-11-12 16:53:03,063 INFO L226 Difference]: Without dead ends: 467 [2024-11-12 16:53:03,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-11-12 16:53:03,064 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:03,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:53:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-12 16:53:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 459. [2024-11-12 16:53:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.1331877729257642) internal successors, (519), 458 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 519 transitions. [2024-11-12 16:53:03,103 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 519 transitions. Word has length 78 [2024-11-12 16:53:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:03,103 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 519 transitions. [2024-11-12 16:53:03,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 519 transitions. [2024-11-12 16:53:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 16:53:03,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:03,107 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:03,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 16:53:03,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:03,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:03,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash -996843208, now seen corresponding path program 1 times [2024-11-12 16:53:03,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:03,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508950773] [2024-11-12 16:53:03,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:03,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 132 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-12 16:53:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508950773] [2024-11-12 16:53:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508950773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884376780] [2024-11-12 16:53:03,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:03,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:03,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 16:53:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:03,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:53:03,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 132 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-12 16:53:03,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:53:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 132 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-12 16:53:03,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884376780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:53:03,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:53:03,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-12 16:53:03,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044279000] [2024-11-12 16:53:03,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:53:03,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:53:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:03,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:53:03,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:53:03,558 INFO L87 Difference]: Start difference. First operand 459 states and 519 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:03,612 INFO L93 Difference]: Finished difference Result 606 states and 683 transitions. [2024-11-12 16:53:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:53:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 82 [2024-11-12 16:53:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:03,614 INFO L225 Difference]: With dead ends: 606 [2024-11-12 16:53:03,614 INFO L226 Difference]: Without dead ends: 214 [2024-11-12 16:53:03,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:53:03,616 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:03,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:53:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-12 16:53:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2024-11-12 16:53:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.0721153846153846) internal successors, (223), 208 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2024-11-12 16:53:03,626 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 82 [2024-11-12 16:53:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:03,628 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2024-11-12 16:53:03,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2024-11-12 16:53:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 16:53:03,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:03,633 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:03,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 16:53:03,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:03,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:03,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash -771565384, now seen corresponding path program 2 times [2024-11-12 16:53:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:03,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390964999] [2024-11-12 16:53:03,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 204 proven. 111 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-12 16:53:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390964999] [2024-11-12 16:53:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390964999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384922103] [2024-11-12 16:53:04,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:53:04,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:04,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:04,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:04,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 16:53:04,071 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:53:04,072 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:53:04,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:53:04,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 204 proven. 111 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-12 16:53:04,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:53:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 204 proven. 111 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-12 16:53:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384922103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:53:04,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:53:04,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2024-11-12 16:53:04,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354125973] [2024-11-12 16:53:04,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:53:04,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:53:04,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:04,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:53:04,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:53:04,295 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:04,360 INFO L93 Difference]: Finished difference Result 285 states and 302 transitions. [2024-11-12 16:53:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:53:04,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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 82 [2024-11-12 16:53:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:04,362 INFO L225 Difference]: With dead ends: 285 [2024-11-12 16:53:04,362 INFO L226 Difference]: Without dead ends: 151 [2024-11-12 16:53:04,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 11 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:53:04,363 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:04,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:53:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-12 16:53:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2024-11-12 16:53:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.0633802816901408) internal successors, (151), 142 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2024-11-12 16:53:04,370 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 82 [2024-11-12 16:53:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:04,371 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2024-11-12 16:53:04,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2024-11-12 16:53:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 16:53:04,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:04,372 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:04,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 16:53:04,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-12 16:53:04,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:04,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1666726138, now seen corresponding path program 3 times [2024-11-12 16:53:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732103608] [2024-11-12 16:53:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:53:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732103608] [2024-11-12 16:53:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732103608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999550038] [2024-11-12 16:53:04,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:53:04,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:04,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:04,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 16:53:04,850 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-12 16:53:04,850 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:53:04,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:53:04,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:53:04,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:53:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:53:05,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999550038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:53:05,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:53:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-12 16:53:05,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659175864] [2024-11-12 16:53:05,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:53:05,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 16:53:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 16:53:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-12 16:53:05,254 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 24 states, 23 states have (on average 7.086956521739131) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:05,331 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2024-11-12 16:53:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 16:53:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.086956521739131) internal successors, (163), 24 states have internal predecessors, (163), 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 82 [2024-11-12 16:53:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:05,334 INFO L225 Difference]: With dead ends: 232 [2024-11-12 16:53:05,335 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 16:53:05,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-12 16:53:05,337 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:05,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 167 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:53:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 16:53:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-11-12 16:53:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.0391304347826087) internal successors, (239), 230 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 239 transitions. [2024-11-12 16:53:05,347 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 239 transitions. Word has length 82 [2024-11-12 16:53:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:05,348 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 239 transitions. [2024-11-12 16:53:05,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.086956521739131) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 239 transitions. [2024-11-12 16:53:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 16:53:05,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:05,352 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 3, 2, 2, 2, 1, 1, 1] [2024-11-12 16:53:05,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 16:53:05,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 16:53:05,554 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:05,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash -366284273, now seen corresponding path program 4 times [2024-11-12 16:53:05,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:05,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449297101] [2024-11-12 16:53:05,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:05,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:53:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449297101] [2024-11-12 16:53:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449297101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157571299] [2024-11-12 16:53:06,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 16:53:06,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:06,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:06,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 16:53:06,356 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 16:53:06,356 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:53:06,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 16:53:06,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:53:06,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:53:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:53:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157571299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:53:07,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:53:07,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-11-12 16:53:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974714000] [2024-11-12 16:53:07,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:53:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 16:53:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 16:53:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 16:53:07,558 INFO L87 Difference]: Start difference. First operand 231 states and 239 transitions. Second operand has 48 states, 47 states have (on average 7.212765957446808) internal successors, (339), 48 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:07,751 INFO L93 Difference]: Finished difference Result 412 states and 443 transitions. [2024-11-12 16:53:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-12 16:53:07,752 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 7.212765957446808) internal successors, (339), 48 states have internal predecessors, (339), 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 170 [2024-11-12 16:53:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:07,767 INFO L225 Difference]: With dead ends: 412 [2024-11-12 16:53:07,767 INFO L226 Difference]: Without dead ends: 411 [2024-11-12 16:53:07,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 16:53:07,769 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:07,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 305 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:53:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-12 16:53:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2024-11-12 16:53:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.0219512195121951) internal successors, (419), 410 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 419 transitions. [2024-11-12 16:53:07,784 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 419 transitions. Word has length 170 [2024-11-12 16:53:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:07,784 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 419 transitions. [2024-11-12 16:53:07,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.212765957446808) internal successors, (339), 48 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 419 transitions. [2024-11-12 16:53:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-12 16:53:07,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:07,788 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 6, 5, 5, 5, 1, 1, 1] [2024-11-12 16:53:07,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 16:53:07,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:07,989 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1031670202, now seen corresponding path program 5 times [2024-11-12 16:53:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:07,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010289007] [2024-11-12 16:53:07,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:53:10,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:10,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010289007] [2024-11-12 16:53:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010289007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:10,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954386163] [2024-11-12 16:53:10,253 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 16:53:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:10,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:10,255 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:10,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 16:53:10,409 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-12 16:53:10,409 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:53:10,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-12 16:53:10,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:53:10,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:53:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:53:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954386163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:53:13,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:53:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2024-11-12 16:53:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567027754] [2024-11-12 16:53:13,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:53:13,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-12 16:53:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:13,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-12 16:53:13,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-12 16:53:13,595 INFO L87 Difference]: Start difference. First operand 411 states and 419 transitions. Second operand has 96 states, 95 states have (on average 7.3578947368421055) internal successors, (699), 96 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:14,028 INFO L93 Difference]: Finished difference Result 768 states and 823 transitions. [2024-11-12 16:53:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-12 16:53:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 7.3578947368421055) internal successors, (699), 96 states have internal predecessors, (699), 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 350 [2024-11-12 16:53:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:14,032 INFO L225 Difference]: With dead ends: 768 [2024-11-12 16:53:14,032 INFO L226 Difference]: Without dead ends: 767 [2024-11-12 16:53:14,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-12 16:53:14,036 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:14,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 624 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 16:53:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-12 16:53:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2024-11-12 16:53:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.0117493472584855) internal successors, (775), 766 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 775 transitions. [2024-11-12 16:53:14,057 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 775 transitions. Word has length 350 [2024-11-12 16:53:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:14,058 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 775 transitions. [2024-11-12 16:53:14,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 7.3578947368421055) internal successors, (699), 96 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 775 transitions. [2024-11-12 16:53:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-12 16:53:14,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:53:14,070 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 11, 10, 10, 10, 1, 1, 1] [2024-11-12 16:53:14,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 16:53:14,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-12 16:53:14,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:53:14,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:53:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 390262927, now seen corresponding path program 6 times [2024-11-12 16:53:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:53:14,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024611850] [2024-11-12 16:53:14,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:53:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:53:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:53:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 0 proven. 32197 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 16:53:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:53:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024611850] [2024-11-12 16:53:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024611850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:53:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186117323] [2024-11-12 16:53:21,353 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 16:53:21,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:53:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:53:21,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:53:21,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 16:53:21,630 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) [2024-11-12 16:53:21,630 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:53:21,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:53:21,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:53:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 29535 proven. 0 refuted. 0 times theorem prover too weak. 2672 trivial. 0 not checked. [2024-11-12 16:53:22,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:53:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186117323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:53:22,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:53:22,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [96] total 108 [2024-11-12 16:53:22,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521704909] [2024-11-12 16:53:22,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:53:22,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 16:53:22,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:53:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 16:53:22,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-11-12 16:53:22,742 INFO L87 Difference]: Start difference. First operand 767 states and 775 transitions. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:53:22,823 INFO L93 Difference]: Finished difference Result 767 states and 775 transitions. [2024-11-12 16:53:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 16:53:22,824 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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 706 [2024-11-12 16:53:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:53:22,825 INFO L225 Difference]: With dead ends: 767 [2024-11-12 16:53:22,825 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 16:53:22,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-11-12 16:53:22,829 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:53:22,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:53:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 16:53:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 16:53:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 16:53:22,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 706 [2024-11-12 16:53:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:53:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 16:53:22,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:53:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 16:53:22,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 16:53:22,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-12 16:53:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-12 16:53:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-12 16:53:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-12 16:53:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-12 16:53:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-12 16:53:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-12 16:53:22,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-12 16:53:22,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 16:53:23,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 16:53:23,039 INFO L421 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:53:23,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 16:53:26,284 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:53:26,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:53:26 BoogieIcfgContainer [2024-11-12 16:53:26,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:53:26,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:53:26,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:53:26,364 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:53:26,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:59" (3/4) ... [2024-11-12 16:53:26,366 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 16:53:26,374 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 16:53:26,375 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 16:53:26,375 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-12 16:53:26,467 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:53:26,468 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 16:53:26,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:53:26,469 INFO L158 Benchmark]: Toolchain (without parser) took 27158.77ms. Allocated memory was 142.6MB in the beginning and 782.2MB in the end (delta: 639.6MB). Free memory was 88.9MB in the beginning and 653.1MB in the end (delta: -564.3MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-11-12 16:53:26,469 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:53:26,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.92ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 77.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 16:53:26,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.15ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 75.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:53:26,470 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 74.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:53:26,470 INFO L158 Benchmark]: RCFGBuilder took 372.99ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 113.0MB in the end (delta: -38.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-12 16:53:26,470 INFO L158 Benchmark]: TraceAbstraction took 26375.85ms. Allocated memory was 142.6MB in the beginning and 782.2MB in the end (delta: 639.6MB). Free memory was 112.0MB in the beginning and 657.3MB in the end (delta: -545.3MB). Peak memory consumption was 472.0MB. Max. memory is 16.1GB. [2024-11-12 16:53:26,470 INFO L158 Benchmark]: Witness Printer took 104.92ms. Allocated memory is still 782.2MB. Free memory was 657.3MB in the beginning and 653.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:53:26,472 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.20ms. Allocated memory is still 142.6MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.92ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 77.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.15ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 75.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 74.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 372.99ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 113.0MB in the end (delta: -38.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26375.85ms. Allocated memory was 142.6MB in the beginning and 782.2MB in the end (delta: 639.6MB). Free memory was 112.0MB in the beginning and 657.3MB in the end (delta: -545.3MB). Peak memory consumption was 472.0MB. Max. memory is 16.1GB. * Witness Printer took 104.92ms. Allocated memory is still 782.2MB. Free memory was 657.3MB in the beginning and 653.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: 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, 24 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 18, TraceHistogramMax: 95, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 1902 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1583 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 827 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 319 mSDtfsCounter, 827 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2645 GetRequests, 2301 SyntacticMatches, 11 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=767occurred in iteration=17, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 3298 NumberOfCodeBlocks, 3235 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 4081 ConstructedInterpolants, 0 QuantifiedInterpolants, 11437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2887 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 34528/97360 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 8 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= c) && (j == 11)) && (c <= 2147483615)) && (i <= 9)) && (6 <= i)) || (((((c <= 27) && (0 <= c)) && (12 <= j)) && (2 <= i)) && (i <= 9))) || (((c == 0) && (i == 0)) && (3 == j))) || (((((0 <= c) && (7 == j)) && (c <= 40)) && (i <= 9)) && (4 <= i))) || (((((c <= 45) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (4 <= i))) || ((((j == 4) && (i == 0)) && (c <= 1)) && (0 <= c))) || (((((c <= 2147483627) && (0 <= c)) && (i <= 9)) && (8 <= i)) && (5 == j))) || (((((1 <= i) && (c <= 14)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((7 <= i) && (c <= 2147483616)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 33) && (0 <= c)) && (3 <= i)) && (9 == j)) && (i <= 9))) || (((((c <= 24) && (0 <= c)) && (2 <= i)) && (9 == j)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (c <= 31)) && (7 == j)) && (i <= 9))) || (((((c <= 38) && (0 <= c)) && (i <= 9)) && (5 == j)) && (4 <= i))) || (((((c <= 2147483611) && (0 <= c)) && (7 == j)) && (i <= 9)) && (6 <= i))) || (((((0 <= c) && (c <= 2147483614)) && (i <= 9)) && (j == 10)) && (6 <= i))) || (((((6 == j) && (0 <= c)) && (3 <= i)) && (i <= 9)) && (c <= 30))) || (((((0 <= c) && (j == 11)) && (c <= 26)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483607) && (0 <= c)) && (3 == j)) && (i <= 9)) && (6 <= i))) || (((((5 <= i) && (0 <= c)) && (c <= 2147483603)) && (i <= 9)) && (j == 8))) || (((((j == 4) && (1 <= i)) && (c <= 10)) && (0 <= c)) && (i <= 9))) || (((((c <= 43) && (0 <= c)) && (i <= 9)) && (j == 10)) && (4 <= i))) || (((((7 <= i) && (c <= 2147483620)) && (0 <= c)) && (7 == j)) && (i <= 9))) || ((((c <= 2147483637) && (6 == j)) && (9 == i)) && (0 <= c))) || (((((5 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483604))) || (((((c <= 2147483605) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483632) && (0 <= c)) && (i <= 9)) && (j == 10)) && (8 <= i))) || (((((0 <= c) && (c <= 20)) && (2 <= i)) && (i <= 9)) && (5 == j))) || (((((1 <= i) && (c <= 15)) && (0 <= c)) && (9 == j)) && (i <= 9))) || (((((c <= 25) && (0 <= c)) && (2 <= i)) && (i <= 9)) && (j == 10))) || (((((0 <= c) && (c <= 2147483612)) && (i <= 9)) && (6 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (c <= 6)) && (9 == j)) && (i <= 9))) || (((((j == 4) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 2147483617))) || (((((0 <= c) && (7 == j)) && (i <= 9)) && (c <= 2147483629)) && (8 <= i))) || (((((c <= 2147483606) && (5 <= i)) && (0 <= c)) && (j == 11)) && (i <= 9))) || (((((c <= 21) && (6 == j)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483600) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (5 == j))) || (((((c <= 36) && (0 <= c)) && (3 == j)) && (i <= 9)) && (4 <= i))) || (((((c <= 2147483613) && (0 <= c)) && (9 == j)) && (i <= 9)) && (6 <= i))) || (((((c <= 35) && (0 <= c)) && (3 <= i)) && (j == 11)) && (i <= 9))) || (((((0 <= c) && (c <= 8)) && (j == 11)) && (0 <= i)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (7 == j)) && (i <= 9)) && (c <= 13))) || (((((7 <= i) && (c <= 2147483625)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (c <= 2147483610)) && (i <= 9)) && (6 <= i))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483623)) && (i <= 9)) && (j == 10))) || (((((c <= 4) && (0 <= c)) && (0 <= i)) && (7 == j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (c <= 3))) || (((((c <= 2147483628) && (6 == j)) && (0 <= c)) && (i <= 9)) && (8 <= i))) || (((((j == 4) && (0 <= c)) && (i <= 9)) && (6 <= i)) && (c <= 2147483608))) || (((((c <= 2147483634) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (j == 11)) && (c <= 44)) && (i <= 9)) && (4 <= i))) || (((((0 <= c) && (i <= 9)) && (4 <= i)) && (c <= 41)) && (j == 8))) || (((((c <= 27) && (0 <= c)) && (3 <= i)) && (3 == j)) && (i <= 9))) || (((((5 <= i) && (c <= 2147483602)) && (0 <= c)) && (7 == j)) && (i <= 9))) || (((((j == 4) && (0 <= c)) && (c <= 2147483626)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (c <= 23)) && (2 <= i)) && (i <= 9)) && (j == 8))) || ((((9 == i) && (0 <= c)) && (12 <= j)) && (c <= 2147483643))) || (((((c <= 2147483616) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (6 <= i))) || (((((c <= 42) && (0 <= c)) && (9 == j)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (0 <= c)) && (i <= 9)) && (j == 10)) && (c <= 16))) || (((((0 <= c) && (i <= 9)) && (c <= 2147483630)) && (8 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (12 <= j)) && (c <= 9)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483618)) && (i <= 9)) && (5 == j))) || (((((j == 4) && (c <= 28)) && (0 <= c)) && (3 <= i)) && (i <= 9))) || (((((6 == j) && (c <= 39)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((j == 4) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 46))) || (((((1 <= i) && (0 <= c)) && (3 == j)) && (c <= 9)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (c <= 11)) && (i <= 9)) && (5 == j))) || (((((c <= 2147483607) && (5 <= i)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((c <= 2147483633) && (0 <= c)) && (j == 11)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 29)) && (5 == j))) || (((((7 <= i) && (c <= 2147483619)) && (6 == j)) && (0 <= c)) && (i <= 9))) || ((((9 == i) && (0 <= c)) && (j == 11)) && (c <= 2147483642))) || ((((c <= 2147483641) && (9 == i)) && (0 <= c)) && (j == 10))) || (((((j == 4) && (c <= 19)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || ((((9 == i) && (c <= 2147483634)) && (0 <= c)) && (3 == j))) || ((((9 == i) && (c <= 2147483638)) && (0 <= c)) && (7 == j))) || ((((9 == i) && (c <= 2147483639)) && (0 <= c)) && (j == 8))) || (((((c <= 5) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (j == 8))) || (((((1 <= i) && (0 <= c)) && (j == 11)) && (i <= 9)) && (c <= 17))) || ((((9 == i) && (0 <= c)) && (9 == j)) && (c <= 2147483640))) || (((((c <= 22) && (0 <= c)) && (7 == j)) && (2 <= i)) && (i <= 9))) || (((((c <= 36) && (0 <= c)) && (3 <= i)) && (12 <= j)) && (i <= 9))) || (((((0 <= c) && (0 <= i)) && (c <= 7)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483621) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((6 == j) && (5 <= i)) && (0 <= c)) && (c <= 2147483601)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483624)) && (j == 11)) && (i <= 9))) || ((((c <= 2147483636) && (9 == i)) && (0 <= c)) && (5 == j))) || (((((0 <= c) && (0 <= i)) && (c <= 2)) && (i <= 9)) && (5 == j))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (j == 10)) && (c <= 34))) || (((((0 <= c) && (3 == j)) && (2 <= i)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 32)) && (j == 8))) || (((((5 <= i) && (c <= 45)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 2147483625) && (0 <= c)) && (3 == j)) && (i <= 9)) && (8 <= i))) || (((((c <= 2147483631) && (0 <= c)) && (9 == j)) && (i <= 9)) && (8 <= i))) || (((((7 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483622))) || ((((j == 4) && (9 == i)) && (0 <= c)) && (c <= 2147483635))) || (((((1 <= i) && (0 <= c)) && (12 <= j)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (i <= 9)) && (5 == j)) && (6 <= i)) && (c <= 2147483609))) || (((((j == 4) && (c <= 37)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (6 == j)) && (0 <= c)) && (c <= 12)) && (i <= 9))) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (((((((((((((c <= 2147483625) && (0 <= c)) && (8 <= i)) || (((0 <= c) && (2 <= i)) && (c <= 18))) || (((c <= 27) && (0 <= c)) && (3 <= i))) || (((5 <= i) && (c <= 45)) && (0 <= c))) || (((1 <= i) && (0 <= c)) && (c <= 9))) || (((7 <= i) && (c <= 2147483616)) && (0 <= c))) || (((c <= 2147483607) && (0 <= c)) && (6 <= i))) || (((c <= 2147483634) && (0 <= c)) && (9 <= i))) || (((c <= 36) && (0 <= c)) && (4 <= i))) || ((c == 0) && (i == 0))) || (((10 <= i) && (0 <= c)) && (c <= 2147483643))) RESULT: Ultimate proved your program to be correct! [2024-11-12 16:53:26,504 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