./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/java_BubbleSort-alloca-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/termination-memory-alloca/java_BubbleSort-alloca-2.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 3afeb43b870aed7b577d27af04b4871068d21fc801fb23ff481213b49f83f775 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:06:10,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:06:10,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-04-29 11:06:10,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:06:10,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:06:10,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:06:10,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:06:10,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:06:10,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:06:10,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:06:10,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:06:10,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:06:10,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:06:10,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:06:10,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:06:10,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:06:10,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:06:10,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:06:10,395 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 3afeb43b870aed7b577d27af04b4871068d21fc801fb23ff481213b49f83f775 [2025-04-29 11:06:10,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:06:10,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:06:10,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:06:10,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:06:10,646 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:06:10,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/java_BubbleSort-alloca-2.c [2025-04-29 11:06:11,982 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afe6c3df/7555e82ae8ec47d98ac8bc72425cd8bb/FLAG5ade13adc [2025-04-29 11:06:12,175 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:06:12,176 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/java_BubbleSort-alloca-2.c [2025-04-29 11:06:12,181 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:06:12,181 WARN L117 ultiparseSymbolTable]: System include alloca.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:06:12,197 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afe6c3df/7555e82ae8ec47d98ac8bc72425cd8bb/FLAG5ade13adc [2025-04-29 11:06:13,032 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afe6c3df/7555e82ae8ec47d98ac8bc72425cd8bb [2025-04-29 11:06:13,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:06:13,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:06:13,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:06:13,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:06:13,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:06:13,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669c4e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13, skipping insertion in model container [2025-04-29 11:06:13,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:06:13,206 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:06:13,213 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:06:13,242 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:06:13,254 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:06:13,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13 WrapperNode [2025-04-29 11:06:13,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:06:13,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:06:13,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:06:13,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:06:13,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,286 INFO L138 Inliner]: procedures = 9, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-04-29 11:06:13,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:06:13,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:06:13,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:06:13,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:06:13,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,309 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-04-29 11:06:13,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:06:13,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:06:13,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:06:13,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:06:13,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (1/1) ... [2025-04-29 11:06:13,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:06:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:13,350 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) [2025-04-29 11:06:13,353 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 [2025-04-29 11:06:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:06:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:06:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:06:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:06:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:06:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:06:13,412 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:06:13,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:06:13,544 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-04-29 11:06:13,544 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:06:13,552 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:06:13,555 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:06:13,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:06:13 BoogieIcfgContainer [2025-04-29 11:06:13,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:06:13,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:06:13,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:06:13,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:06:13,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:06:13" (1/3) ... [2025-04-29 11:06:13,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2674d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:06:13, skipping insertion in model container [2025-04-29 11:06:13,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:06:13" (2/3) ... [2025-04-29 11:06:13,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2674d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:06:13, skipping insertion in model container [2025-04-29 11:06:13,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:06:13" (3/3) ... [2025-04-29 11:06:13,565 INFO L128 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca-2.c [2025-04-29 11:06:13,576 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:06:13,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG java_BubbleSort-alloca-2.c that has 1 procedures, 43 locations, 48 edges, 1 initial locations, 3 loop locations, and 14 error locations. [2025-04-29 11:06:13,619 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:06:13,627 INFO L340 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;@1429362, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:06:13,629 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-29 11:06:13,632 INFO L278 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:13,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:06:13,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:13,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:06:13,636 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:13,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 889508744, now seen corresponding path program 1 times [2025-04-29 11:06:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:13,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086225543] [2025-04-29 11:06:13,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:13,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:06:13,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:06:13,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:13,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:13,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086225543] [2025-04-29 11:06:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086225543] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:06:13,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060629376] [2025-04-29 11:06:13,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:13,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:13,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:13,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:13,838 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2025-04-29 11:06:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:13,876 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-04-29 11:06:13,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:13,878 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-04-29 11:06:13,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:13,882 INFO L225 Difference]: With dead ends: 82 [2025-04-29 11:06:13,883 INFO L226 Difference]: Without dead ends: 42 [2025-04-29 11:06:13,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:13,886 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:13,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-29 11:06:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-04-29 11:06:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 41 states have internal predecessors, (47), 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) [2025-04-29 11:06:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-04-29 11:06:13,912 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 6 [2025-04-29 11:06:13,913 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:13,913 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-04-29 11:06:13,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2025-04-29 11:06:13,913 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-04-29 11:06:13,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:06:13,913 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:13,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:13,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:06:13,914 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:13,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1804973360, now seen corresponding path program 1 times [2025-04-29 11:06:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:13,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804358746] [2025-04-29 11:06:13,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:13,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:13,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:06:13,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:06:13,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:13,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:13,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:13,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804358746] [2025-04-29 11:06:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804358746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:13,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:13,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:06:13,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544508106] [2025-04-29 11:06:13,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:13,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:13,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:13,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:13,978 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:14,004 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-04-29 11:06:14,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:14,005 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:06:14,005 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:14,005 INFO L225 Difference]: With dead ends: 72 [2025-04-29 11:06:14,005 INFO L226 Difference]: Without dead ends: 42 [2025-04-29 11:06:14,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:14,006 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:14,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-29 11:06:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-04-29 11:06:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 41 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) [2025-04-29 11:06:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-04-29 11:06:14,009 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 7 [2025-04-29 11:06:14,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:14,009 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-04-29 11:06:14,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:14,009 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-04-29 11:06:14,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:06:14,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:14,010 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:14,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:06:14,010 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:14,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -593177271, now seen corresponding path program 1 times [2025-04-29 11:06:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:14,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821625874] [2025-04-29 11:06:14,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:14,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:14,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:06:14,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:06:14,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:14,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:14,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821625874] [2025-04-29 11:06:14,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821625874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:14,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669653594] [2025-04-29 11:06:14,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:14,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:14,130 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) [2025-04-29 11:06:14,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:06:14,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:06:14,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:06:14,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:14,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:14,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:06:14,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:14,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:06:14,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669653594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:14,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:06:14,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:06:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895652884] [2025-04-29 11:06:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:14,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:06:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:14,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:06:14,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:06:14,206 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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) [2025-04-29 11:06:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:14,246 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-04-29 11:06:14,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:06:14,246 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 [2025-04-29 11:06:14,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:14,248 INFO L225 Difference]: With dead ends: 42 [2025-04-29 11:06:14,248 INFO L226 Difference]: Without dead ends: 41 [2025-04-29 11:06:14,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:06:14,248 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:14,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-29 11:06:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-04-29 11:06:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 40 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) [2025-04-29 11:06:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-04-29 11:06:14,251 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 9 [2025-04-29 11:06:14,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:14,251 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-04-29 11:06:14,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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) [2025-04-29 11:06:14,253 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-04-29 11:06:14,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:06:14,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:14,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:14,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:06:14,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:14,458 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:14,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1208620145, now seen corresponding path program 1 times [2025-04-29 11:06:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:14,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943657585] [2025-04-29 11:06:14,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:14,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:06:14,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:06:14,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:14,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:14,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943657585] [2025-04-29 11:06:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943657585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:14,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:14,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:06:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394448210] [2025-04-29 11:06:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:14,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:06:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:14,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:06:14,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:06:14,488 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:14,504 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-04-29 11:06:14,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:06:14,504 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:06:14,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:14,505 INFO L225 Difference]: With dead ends: 41 [2025-04-29 11:06:14,505 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:06:14,505 INFO L436 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 [2025-04-29 11:06:14,505 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:14,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:06:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:06:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 39 states have internal predecessors, (44), 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) [2025-04-29 11:06:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-04-29 11:06:14,512 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 10 [2025-04-29 11:06:14,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:14,512 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-04-29 11:06:14,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:14,512 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-04-29 11:06:14,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:06:14,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:14,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:14,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:06:14,513 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:14,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1208626170, now seen corresponding path program 1 times [2025-04-29 11:06:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:14,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204327457] [2025-04-29 11:06:14,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:14,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:06:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:06:14,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:14,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:14,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204327457] [2025-04-29 11:06:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204327457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:14,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543128816] [2025-04-29 11:06:14,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:14,618 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) [2025-04-29 11:06:14,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:06:14,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:06:14,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:06:14,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:14,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:06:14,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:14,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:14,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543128816] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:14,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:14,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-04-29 11:06:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521473068] [2025-04-29 11:06:14,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:14,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:06:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:14,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:06:14,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:06:14,745 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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) [2025-04-29 11:06:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:14,795 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2025-04-29 11:06:14,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:06:14,795 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:06:14,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:14,797 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:06:14,797 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:06:14,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:06:14,798 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:14,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:06:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 11:06:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 53 states have internal predecessors, (61), 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) [2025-04-29 11:06:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-04-29 11:06:14,802 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 10 [2025-04-29 11:06:14,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:14,802 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-04-29 11:06:14,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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) [2025-04-29 11:06:14,802 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-04-29 11:06:14,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:06:14,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:14,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:14,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:06:15,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:15,008 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:15,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1187481229, now seen corresponding path program 1 times [2025-04-29 11:06:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:15,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852944894] [2025-04-29 11:06:15,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:15,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:06:15,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:06:15,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:15,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852944894] [2025-04-29 11:06:15,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852944894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:15,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:15,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:06:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138692823] [2025-04-29 11:06:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:15,064 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:15,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:15,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:15,064 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:06:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:15,092 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-04-29 11:06:15,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:15,093 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-04-29 11:06:15,093 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:15,093 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:06:15,093 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:06:15,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:15,094 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:15,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:06:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-29 11:06:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 48 states have internal predecessors, (55), 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) [2025-04-29 11:06:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-04-29 11:06:15,099 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 11 [2025-04-29 11:06:15,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:15,099 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-04-29 11:06:15,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:06:15,099 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2025-04-29 11:06:15,100 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:06:15,100 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:15,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:15,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:06:15,100 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:15,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1867539599, now seen corresponding path program 1 times [2025-04-29 11:06:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:15,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314259025] [2025-04-29 11:06:15,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:15,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:06:15,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:06:15,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:15,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314259025] [2025-04-29 11:06:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314259025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:15,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85819207] [2025-04-29 11:06:15,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:15,154 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) [2025-04-29 11:06:15,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:06:15,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:06:15,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:06:15,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:06:15,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:15,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:06:15,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85819207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:15,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:06:15,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-29 11:06:15,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490631440] [2025-04-29 11:06:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:15,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:15,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:15,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:06:15,228 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:06:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:15,257 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-04-29 11:06:15,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:15,257 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-04-29 11:06:15,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:15,258 INFO L225 Difference]: With dead ends: 74 [2025-04-29 11:06:15,258 INFO L226 Difference]: Without dead ends: 73 [2025-04-29 11:06:15,258 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:06:15,259 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:15,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-29 11:06:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2025-04-29 11:06:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 63 states have internal predecessors, (80), 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) [2025-04-29 11:06:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-04-29 11:06:15,266 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2025-04-29 11:06:15,266 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:15,266 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-04-29 11:06:15,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:06:15,266 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-04-29 11:06:15,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:06:15,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:15,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:15,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:06:15,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:15,467 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:15,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1134095886, now seen corresponding path program 1 times [2025-04-29 11:06:15,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:15,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554053585] [2025-04-29 11:06:15,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:06:15,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:06:15,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:15,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554053585] [2025-04-29 11:06:15,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554053585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:15,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:15,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:06:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189390937] [2025-04-29 11:06:15,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:15,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:06:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:15,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:06:15,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:06:15,493 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-04-29 11:06:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:15,525 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2025-04-29 11:06:15,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:06:15,526 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-04-29 11:06:15,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:15,526 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:06:15,526 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:06:15,527 INFO L436 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 [2025-04-29 11:06:15,527 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:15,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:06:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-04-29 11:06:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.445945945945946) internal successors, (107), 85 states have internal predecessors, (107), 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) [2025-04-29 11:06:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2025-04-29 11:06:15,545 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 14 [2025-04-29 11:06:15,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:15,546 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2025-04-29 11:06:15,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-04-29 11:06:15,546 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2025-04-29 11:06:15,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:06:15,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:15,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:15,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:06:15,547 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:15,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1134093100, now seen corresponding path program 1 times [2025-04-29 11:06:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:15,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461628501] [2025-04-29 11:06:15,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:15,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:06:15,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:06:15,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:15,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461628501] [2025-04-29 11:06:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461628501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:06:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479679192] [2025-04-29 11:06:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:15,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:15,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:15,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:15,573 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-04-29 11:06:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:15,595 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2025-04-29 11:06:15,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:15,596 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-04-29 11:06:15,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:15,596 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:06:15,596 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:06:15,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:15,597 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:15,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 91 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:06:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2025-04-29 11:06:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 88 states have internal predecessors, (110), 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) [2025-04-29 11:06:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2025-04-29 11:06:15,609 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 14 [2025-04-29 11:06:15,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:15,609 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2025-04-29 11:06:15,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-04-29 11:06:15,609 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2025-04-29 11:06:15,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:06:15,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:15,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:15,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:06:15,610 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:15,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash 770332001, now seen corresponding path program 1 times [2025-04-29 11:06:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:15,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025832619] [2025-04-29 11:06:15,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:15,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:06:15,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:06:15,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:15,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025832619] [2025-04-29 11:06:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025832619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:15,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:15,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:06:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005978499] [2025-04-29 11:06:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:15,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:15,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:15,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:15,641 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:15,677 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2025-04-29 11:06:15,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:15,677 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:06:15,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:15,678 INFO L225 Difference]: With dead ends: 98 [2025-04-29 11:06:15,678 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:06:15,678 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:15,678 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:15,679 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:06:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-04-29 11:06:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 94 states have internal predecessors, (116), 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) [2025-04-29 11:06:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-04-29 11:06:15,683 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 18 [2025-04-29 11:06:15,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:15,683 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-04-29 11:06:15,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:15,683 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-04-29 11:06:15,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:06:15,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:15,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:15,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:06:15,684 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:15,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -950932119, now seen corresponding path program 1 times [2025-04-29 11:06:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:15,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715887199] [2025-04-29 11:06:15,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:15,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:06:15,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:06:15,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:15,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715887199] [2025-04-29 11:06:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715887199] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:06:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700390793] [2025-04-29 11:06:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:15,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:06:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:15,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:06:15,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:06:15,711 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:15,750 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2025-04-29 11:06:15,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:06:15,751 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:06:15,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:15,751 INFO L225 Difference]: With dead ends: 141 [2025-04-29 11:06:15,751 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:06:15,752 INFO L436 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 [2025-04-29 11:06:15,752 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:15,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:06:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:06:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 94 states have internal predecessors, (114), 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) [2025-04-29 11:06:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2025-04-29 11:06:15,756 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 18 [2025-04-29 11:06:15,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:15,756 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2025-04-29 11:06:15,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:15,757 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2025-04-29 11:06:15,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:06:15,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:15,757 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-04-29 11:06:15,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:06:15,760 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:15,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash -995229463, now seen corresponding path program 1 times [2025-04-29 11:06:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:15,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435405769] [2025-04-29 11:06:15,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:15,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:06:15,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:06:15,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:15,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435405769] [2025-04-29 11:06:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435405769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:15,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136062252] [2025-04-29 11:06:15,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:15,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:15,863 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) [2025-04-29 11:06:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:06:15,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:06:15,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:06:15,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:15,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:15,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:06:15,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:15,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:06:16,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136062252] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:16,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:16,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-29 11:06:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795479833] [2025-04-29 11:06:16,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:16,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:06:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:16,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:06:16,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:06:16,101 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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) [2025-04-29 11:06:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:16,151 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2025-04-29 11:06:16,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:06:16,151 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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 19 [2025-04-29 11:06:16,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:16,152 INFO L225 Difference]: With dead ends: 114 [2025-04-29 11:06:16,153 INFO L226 Difference]: Without dead ends: 113 [2025-04-29 11:06:16,153 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:06:16,154 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:16,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-29 11:06:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-29 11:06:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 112 states have internal predecessors, (138), 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) [2025-04-29 11:06:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2025-04-29 11:06:16,163 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 19 [2025-04-29 11:06:16,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:16,163 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2025-04-29 11:06:16,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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) [2025-04-29 11:06:16,163 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2025-04-29 11:06:16,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:06:16,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:16,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:16,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:06:16,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:16,364 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:16,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:16,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1338720538, now seen corresponding path program 1 times [2025-04-29 11:06:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:16,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567521826] [2025-04-29 11:06:16,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:16,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:06:16,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:06:16,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:16,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:06:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:16,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567521826] [2025-04-29 11:06:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567521826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:16,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370516969] [2025-04-29 11:06:16,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:16,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:16,404 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) [2025-04-29 11:06:16,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:06:16,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:06:16,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:06:16,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:16,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:16,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:06:16,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:06:16,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:06:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370516969] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:16,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2025-04-29 11:06:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974335712] [2025-04-29 11:06:16,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:16,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:06:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:16,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:06:16,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:06:16,510 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-04-29 11:06:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:16,617 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2025-04-29 11:06:16,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:06:16,618 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 [2025-04-29 11:06:16,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:16,618 INFO L225 Difference]: With dead ends: 214 [2025-04-29 11:06:16,618 INFO L226 Difference]: Without dead ends: 139 [2025-04-29 11:06:16,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:06:16,619 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:16,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 159 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:06:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-04-29 11:06:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2025-04-29 11:06:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 121 states have (on average 1.371900826446281) internal successors, (166), 132 states have internal predecessors, (166), 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) [2025-04-29 11:06:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 166 transitions. [2025-04-29 11:06:16,623 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 166 transitions. Word has length 24 [2025-04-29 11:06:16,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:16,623 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 166 transitions. [2025-04-29 11:06:16,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-04-29 11:06:16,623 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 166 transitions. [2025-04-29 11:06:16,624 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:06:16,624 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:16,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:16,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:06:16,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:06:16,825 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:16,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:16,825 INFO L85 PathProgramCache]: Analyzing trace with hash -51671428, now seen corresponding path program 1 times [2025-04-29 11:06:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:16,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990743252] [2025-04-29 11:06:16,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:16,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:06:16,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:06:16,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:16,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:06:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:16,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990743252] [2025-04-29 11:06:16,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990743252] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:16,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130150676] [2025-04-29 11:06:16,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:16,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:16,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:16,873 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) [2025-04-29 11:06:16,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:06:16,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:06:16,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:06:16,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:16,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:16,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:06:16,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:06:16,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:06:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130150676] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:16,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:16,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-29 11:06:16,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472259082] [2025-04-29 11:06:16,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:16,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:06:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:06:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:06:16,968 INFO L87 Difference]: Start difference. First operand 133 states and 166 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 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) [2025-04-29 11:06:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:17,042 INFO L93 Difference]: Finished difference Result 158 states and 199 transitions. [2025-04-29 11:06:17,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:06:17,042 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 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 28 [2025-04-29 11:06:17,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:17,043 INFO L225 Difference]: With dead ends: 158 [2025-04-29 11:06:17,043 INFO L226 Difference]: Without dead ends: 154 [2025-04-29 11:06:17,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:06:17,043 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:17,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 121 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:06:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-29 11:06:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-04-29 11:06:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 150 states have internal predecessors, (185), 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) [2025-04-29 11:06:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 185 transitions. [2025-04-29 11:06:17,050 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 185 transitions. Word has length 28 [2025-04-29 11:06:17,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:17,050 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 185 transitions. [2025-04-29 11:06:17,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 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) [2025-04-29 11:06:17,051 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2025-04-29 11:06:17,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:06:17,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:17,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:17,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:06:17,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:17,256 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:17,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1745136102, now seen corresponding path program 1 times [2025-04-29 11:06:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:17,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924215770] [2025-04-29 11:06:17,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:17,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:06:17,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:06:17,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:17,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:06:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:17,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924215770] [2025-04-29 11:06:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924215770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:17,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:06:17,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016929608] [2025-04-29 11:06:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:17,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:17,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:17,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:17,296 INFO L87 Difference]: Start difference. First operand 151 states and 185 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) [2025-04-29 11:06:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:17,322 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2025-04-29 11:06:17,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:17,323 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 31 [2025-04-29 11:06:17,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:17,323 INFO L225 Difference]: With dead ends: 151 [2025-04-29 11:06:17,324 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:06:17,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:17,325 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:17,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:06:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-29 11:06:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 146 states have internal predecessors, (173), 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) [2025-04-29 11:06:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 173 transitions. [2025-04-29 11:06:17,331 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 173 transitions. Word has length 31 [2025-04-29 11:06:17,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:17,331 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 173 transitions. [2025-04-29 11:06:17,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) [2025-04-29 11:06:17,332 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 173 transitions. [2025-04-29 11:06:17,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:06:17,332 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:17,332 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:17,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:06:17,332 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:17,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash 828567074, now seen corresponding path program 1 times [2025-04-29 11:06:17,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:17,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471750424] [2025-04-29 11:06:17,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:17,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:06:17,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:06:17,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:17,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:06:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:17,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471750424] [2025-04-29 11:06:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471750424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:17,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532195046] [2025-04-29 11:06:17,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:17,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:17,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:17,436 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) [2025-04-29 11:06:17,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:06:17,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:06:17,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:06:17,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:17,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:06:17,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:06:17,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:06:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532195046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:17,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:06:17,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-04-29 11:06:17,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852701585] [2025-04-29 11:06:17,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:17,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:06:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:17,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:06:17,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:06:17,597 INFO L87 Difference]: Start difference. First operand 147 states and 173 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:17,639 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2025-04-29 11:06:17,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:06:17,639 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:06:17,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:17,640 INFO L225 Difference]: With dead ends: 149 [2025-04-29 11:06:17,640 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:06:17,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:06:17,641 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:17,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 119 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:06:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2025-04-29 11:06:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 144 states have internal predecessors, (168), 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) [2025-04-29 11:06:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2025-04-29 11:06:17,648 INFO L79 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 31 [2025-04-29 11:06:17,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:17,648 INFO L485 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2025-04-29 11:06:17,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:17,648 INFO L278 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2025-04-29 11:06:17,649 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:06:17,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:17,650 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1] [2025-04-29 11:06:17,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:06:17,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:17,851 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:17,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 337255241, now seen corresponding path program 2 times [2025-04-29 11:06:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:17,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982912326] [2025-04-29 11:06:17,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:06:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:17,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:06:17,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 37 statements. [2025-04-29 11:06:17,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:06:17,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:06:17,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:17,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982912326] [2025-04-29 11:06:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982912326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:17,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866921143] [2025-04-29 11:06:17,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:06:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:17,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:17,878 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) [2025-04-29 11:06:17,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:06:17,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:06:17,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 37 statements. [2025-04-29 11:06:17,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:06:17,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:17,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:06:17,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:06:17,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:06:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866921143] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:17,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:06:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766983876] [2025-04-29 11:06:17,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:17,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:17,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:17,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:17,994 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:18,009 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2025-04-29 11:06:18,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:18,010 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-29 11:06:18,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:18,010 INFO L225 Difference]: With dead ends: 145 [2025-04-29 11:06:18,011 INFO L226 Difference]: Without dead ends: 144 [2025-04-29 11:06:18,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:06:18,011 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:18,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-29 11:06:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2025-04-29 11:06:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 1.1565217391304348) internal successors, (133), 117 states have internal predecessors, (133), 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) [2025-04-29 11:06:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2025-04-29 11:06:18,018 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 37 [2025-04-29 11:06:18,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:18,018 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2025-04-29 11:06:18,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:18,018 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2025-04-29 11:06:18,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:06:18,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:18,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:18,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:06:18,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:06:18,223 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:18,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash -162782132, now seen corresponding path program 1 times [2025-04-29 11:06:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:18,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413723901] [2025-04-29 11:06:18,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:06:18,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:06:18,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:18,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-29 11:06:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:18,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413723901] [2025-04-29 11:06:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413723901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:06:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:06:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:06:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027986152] [2025-04-29 11:06:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:06:18,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:06:18,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:18,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:06:18,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:18,262 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) [2025-04-29 11:06:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:18,285 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2025-04-29 11:06:18,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:06:18,285 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 42 [2025-04-29 11:06:18,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:18,285 INFO L225 Difference]: With dead ends: 118 [2025-04-29 11:06:18,285 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:06:18,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:06:18,286 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:18,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:06:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-04-29 11:06:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.1391304347826088) internal successors, (131), 116 states have internal predecessors, (131), 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) [2025-04-29 11:06:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2025-04-29 11:06:18,290 INFO L79 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 42 [2025-04-29 11:06:18,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:18,290 INFO L485 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2025-04-29 11:06:18,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) [2025-04-29 11:06:18,290 INFO L278 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2025-04-29 11:06:18,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:06:18,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:18,292 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:18,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:06:18,292 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:18,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash 366033901, now seen corresponding path program 1 times [2025-04-29 11:06:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:18,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257560280] [2025-04-29 11:06:18,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:18,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:06:18,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:06:18,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:18,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:06:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:18,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257560280] [2025-04-29 11:06:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257560280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:18,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647458550] [2025-04-29 11:06:18,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:06:18,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:18,425 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) [2025-04-29 11:06:18,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:06:18,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:06:18,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:06:18,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:06:18,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:18,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:06:18,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:06:18,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:06:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647458550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:18,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:18,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-04-29 11:06:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751561079] [2025-04-29 11:06:18,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:18,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:06:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:18,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:06:18,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:06:18,657 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 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) [2025-04-29 11:06:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:18,720 INFO L93 Difference]: Finished difference Result 228 states and 255 transitions. [2025-04-29 11:06:18,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:06:18,721 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 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 45 [2025-04-29 11:06:18,721 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:18,721 INFO L225 Difference]: With dead ends: 228 [2025-04-29 11:06:18,721 INFO L226 Difference]: Without dead ends: 170 [2025-04-29 11:06:18,722 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:06:18,722 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:18,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 164 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:06:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-29 11:06:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2025-04-29 11:06:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.125748502994012) internal successors, (188), 168 states have internal predecessors, (188), 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) [2025-04-29 11:06:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 188 transitions. [2025-04-29 11:06:18,729 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 188 transitions. Word has length 45 [2025-04-29 11:06:18,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:18,729 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 188 transitions. [2025-04-29 11:06:18,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 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) [2025-04-29 11:06:18,729 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 188 transitions. [2025-04-29 11:06:18,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:06:18,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:18,730 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:18,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:06:18,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:18,934 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:18,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2007041772, now seen corresponding path program 2 times [2025-04-29 11:06:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:18,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557948620] [2025-04-29 11:06:18,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:06:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:18,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-29 11:06:18,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 48 statements. [2025-04-29 11:06:18,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:06:18,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-29 11:06:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:18,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557948620] [2025-04-29 11:06:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557948620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:18,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884204264] [2025-04-29 11:06:18,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:06:18,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:18,971 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:06:18,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:06:19,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-29 11:06:19,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 48 statements. [2025-04-29 11:06:19,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:06:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:19,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:06:19,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-29 11:06:19,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-29 11:06:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884204264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:19,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-29 11:06:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960242762] [2025-04-29 11:06:19,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:19,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:06:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:19,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:06:19,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:06:19,204 INFO L87 Difference]: Start difference. First operand 169 states and 188 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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) [2025-04-29 11:06:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:19,291 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2025-04-29 11:06:19,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:06:19,291 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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 48 [2025-04-29 11:06:19,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:19,292 INFO L225 Difference]: With dead ends: 169 [2025-04-29 11:06:19,292 INFO L226 Difference]: Without dead ends: 119 [2025-04-29 11:06:19,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:06:19,293 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:19,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 43 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:06:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-29 11:06:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 57. [2025-04-29 11:06:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 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) [2025-04-29 11:06:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-04-29 11:06:19,296 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 48 [2025-04-29 11:06:19,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:19,296 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-04-29 11:06:19,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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) [2025-04-29 11:06:19,296 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-04-29 11:06:19,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:06:19,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:06:19,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:19,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:06:19,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:19,501 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:06:19,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:06:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1910443832, now seen corresponding path program 2 times [2025-04-29 11:06:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:06:19,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763510873] [2025-04-29 11:06:19,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:06:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:06:19,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-29 11:06:19,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 48 statements. [2025-04-29 11:06:19,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:06:19,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:06:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:06:19,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763510873] [2025-04-29 11:06:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763510873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:06:19,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366152047] [2025-04-29 11:06:19,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:06:19,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:06:19,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:06:19,544 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:06:19,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:06:19,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-29 11:06:19,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 48 statements. [2025-04-29 11:06:19,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:06:19,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:06:19,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:06:19,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:06:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:06:19,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:06:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:06:19,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366152047] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:06:19,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:06:19,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 11:06:19,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476810743] [2025-04-29 11:06:19,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:06:19,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:06:19,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:06:19,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:06:19,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:06:19,672 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:06:19,698 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-04-29 11:06:19,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:06:19,699 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-04-29 11:06:19,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:06:19,699 INFO L225 Difference]: With dead ends: 57 [2025-04-29 11:06:19,699 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:06:19,699 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:06:19,699 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:06:19,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:06:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:06:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:06:19,700 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) [2025-04-29 11:06:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:06:19,700 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2025-04-29 11:06:19,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:06:19,700 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:06:19,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:06:19,700 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:06:19,700 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-04-29 11:06:19,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-04-29 11:06:19,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:06:19,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:06:19,909 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:06:19,910 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:06:20,050 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:06:20,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:06:20 BoogieIcfgContainer [2025-04-29 11:06:20,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:06:20,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:06:20,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:06:20,064 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:06:20,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:06:13" (3/4) ... [2025-04-29 11:06:20,067 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:06:20,074 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-04-29 11:06:20,074 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-29 11:06:20,074 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:06:20,075 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:06:20,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:06:20,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:06:20,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:06:20,133 INFO L158 Benchmark]: Toolchain (without parser) took 7096.96ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 113.3MB in the beginning and 282.0MB in the end (delta: -168.7MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2025-04-29 11:06:20,133 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:06:20,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.56ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:06:20,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.47ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:06:20,133 INFO L158 Benchmark]: Boogie Preprocessor took 35.35ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:06:20,134 INFO L158 Benchmark]: RCFGBuilder took 233.38ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 83.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:06:20,134 INFO L158 Benchmark]: TraceAbstraction took 6505.63ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 82.3MB in the beginning and 285.8MB in the end (delta: -203.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2025-04-29 11:06:20,134 INFO L158 Benchmark]: Witness Printer took 68.04ms. Allocated memory is still 377.5MB. Free memory was 285.8MB in the beginning and 282.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:06:20,135 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.99ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.56ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.47ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.35ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 233.38ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 83.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6505.63ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 82.3MB in the beginning and 285.8MB in the end (delta: -203.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 68.04ms. Allocated memory is still 377.5MB. Free memory was 285.8MB in the beginning and 282.0MB in the end (delta: 3.9MB). There was no memory consumed. 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: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: 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: 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: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: 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, 43 locations, 48 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 21, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 2101 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1507 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1119 IncrementalHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 594 mSDtfsCounter, 1119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 514 SyntacticMatches, 12 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=19, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 121 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 791 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1010 ConstructedInterpolants, 0 QuantifiedInterpolants, 3144 SizeOfPredicates, 13 NumberOfNonLiveVariables, 783 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 40 InterpolantComputations, 13 PerfectInterpolantSequences, 820/1119 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: (((n <= 2147483647) && (pass == 1)) || ((2 <= pass) && (n <= 2147483647))) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((array_size <= 2147483647) && (1 <= i)) && (1 <= array_size)) || (((array_size <= 2147483647) && (i == 0)) && (1 <= array_size))) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((((0 <= (i + 2147483649)) && (2 <= n)) && (n <= 2147483647)) && (pass == 1)) || ((((0 <= (i + 2147483649)) && (2 <= pass)) && (((long) pass + 1) <= n)) && (n <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:06:20,148 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