./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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 ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-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 01a4b84af22ba9336b377376d27423612474043c2c250fad1845bccdee580746 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:30:10,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:30:10,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:30:10,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:30:10,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:30:10,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:30:10,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:30:10,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:30:10,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:30:10,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:30:10,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:30:10,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:30:10,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:30:10,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:30:10,393 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:30:10,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:30:10,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:30:10,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:30:10,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:30:10,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:30:10,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:30:10,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:30:10,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:30:10,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:30:10,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:30:10,396 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 -> 01a4b84af22ba9336b377376d27423612474043c2c250fad1845bccdee580746 [2025-03-04 10:30:10,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:30:10,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:30:10,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:30:10,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:30:10,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:30:10,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-2.c [2025-03-04 10:30:11,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22cf22bec/5908e0a2e5c443098f2c8769ad637628/FLAG05b158b6a [2025-03-04 10:30:11,927 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:30:11,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-2.c [2025-03-04 10:30:11,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22cf22bec/5908e0a2e5c443098f2c8769ad637628/FLAG05b158b6a [2025-03-04 10:30:12,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22cf22bec/5908e0a2e5c443098f2c8769ad637628 [2025-03-04 10:30:12,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:30:12,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:30:12,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:30:12,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:30:12,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:30:12,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f42b39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12, skipping insertion in model container [2025-03-04 10:30:12,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:30:12,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:30:12,405 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:30:12,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:30:12,425 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:30:12,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12 WrapperNode [2025-03-04 10:30:12,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:30:12,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:30:12,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:30:12,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:30:12,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,447 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2025-03-04 10:30:12,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:30:12,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:30:12,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:30:12,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:30:12,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,458 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:30:12,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:30:12,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:30:12,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:30:12,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:30:12,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (1/1) ... [2025-03-04 10:30:12,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:30:12,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:12,496 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-03-04 10:30:12,499 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-03-04 10:30:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:30:12,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:30:12,567 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:30:12,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:30:12,660 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-04 10:30:12,660 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:30:12,667 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:30:12,667 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:30:12,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:30:12 BoogieIcfgContainer [2025-03-04 10:30:12,667 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:30:12,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:30:12,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:30:12,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:30:12,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:30:12" (1/3) ... [2025-03-04 10:30:12,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665681c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:30:12, skipping insertion in model container [2025-03-04 10:30:12,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:12" (2/3) ... [2025-03-04 10:30:12,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665681c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:30:12, skipping insertion in model container [2025-03-04 10:30:12,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:30:12" (3/3) ... [2025-03-04 10:30:12,676 INFO L128 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-2.c [2025-03-04 10:30:12,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:30:12,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-2.c that has 1 procedures, 22 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 10:30:12,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:30:12,730 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@418f9aa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:30:12,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:30:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 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-03-04 10:30:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:30:12,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:12,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:30:12,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:12,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1596488701, now seen corresponding path program 1 times [2025-03-04 10:30:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:12,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720655081] [2025-03-04 10:30:12,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:12,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:30:12,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:30:12,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:12,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720655081] [2025-03-04 10:30:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720655081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:30:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123916177] [2025-03-04 10:30:12,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:12,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:30:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:12,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:30:12,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:12,886 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-03-04 10:30:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:12,914 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-03-04 10:30:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:30:12,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-03-04 10:30:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:12,920 INFO L225 Difference]: With dead ends: 22 [2025-03-04 10:30:12,921 INFO L226 Difference]: Without dead ends: 17 [2025-03-04 10:30:12,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:12,924 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:12,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-04 10:30:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 10:30:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 states have internal predecessors, (19), 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-03-04 10:30:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-04 10:30:12,949 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 6 [2025-03-04 10:30:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:12,949 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-04 10:30:12,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-03-04 10:30:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-04 10:30:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:30:12,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:12,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:30:12,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:30:12,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:12,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1596488722, now seen corresponding path program 1 times [2025-03-04 10:30:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:12,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597182465] [2025-03-04 10:30:12,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:12,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:30:12,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:30:12,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:12,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597182465] [2025-03-04 10:30:12,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597182465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:12,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:12,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:30:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445324499] [2025-03-04 10:30:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:30:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:13,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:30:13,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:13,000 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-03-04 10:30:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:13,016 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-04 10:30:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:30:13,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-03-04 10:30:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:13,017 INFO L225 Difference]: With dead ends: 25 [2025-03-04 10:30:13,017 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:30:13,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:13,018 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:13,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:30:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-04 10:30:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 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-03-04 10:30:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-04 10:30:13,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 6 [2025-03-04 10:30:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-04 10:30:13,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-03-04 10:30:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-04 10:30:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:30:13,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:13,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:13,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:30:13,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:13,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2048457838, now seen corresponding path program 1 times [2025-03-04 10:30:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972120543] [2025-03-04 10:30:13,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:13,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:30:13,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:30:13,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972120543] [2025-03-04 10:30:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972120543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:13,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:13,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:30:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566247082] [2025-03-04 10:30:13,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:30:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:13,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:30:13,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:13,065 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:13,076 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-04 10:30:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:30:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:30:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:13,076 INFO L225 Difference]: With dead ends: 25 [2025-03-04 10:30:13,076 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:30:13,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:13,077 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:13,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:30:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 10:30:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-04 10:30:13,081 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 7 [2025-03-04 10:30:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:13,082 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-04 10:30:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-04 10:30:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:30:13,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:13,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:30:13,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:13,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:13,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2048457197, now seen corresponding path program 1 times [2025-03-04 10:30:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:13,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697716444] [2025-03-04 10:30:13,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:13,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:30:13,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:30:13,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697716444] [2025-03-04 10:30:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697716444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:13,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:13,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:30:13,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110985356] [2025-03-04 10:30:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:13,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:30:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:13,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:30:13,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:13,113 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:13,137 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-04 10:30:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:30:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:30:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:13,139 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:30:13,139 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:30:13,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:30:13,140 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:13,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:30:13,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-04 10:30:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-04 10:30:13,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2025-03-04 10:30:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:13,146 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-04 10:30:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-04 10:30:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:30:13,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:13,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:13,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:30:13,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1472961328, now seen corresponding path program 1 times [2025-03-04 10:30:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:13,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825532516] [2025-03-04 10:30:13,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:13,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:30:13,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:30:13,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825532516] [2025-03-04 10:30:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825532516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:30:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306973935] [2025-03-04 10:30:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:13,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:30:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:30:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:30:13,202 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:13,230 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-03-04 10:30:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:30:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:30:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:13,232 INFO L225 Difference]: With dead ends: 28 [2025-03-04 10:30:13,232 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 10:30:13,232 INFO L434 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-03-04 10:30:13,232 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:13,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:13,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 10:30:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-03-04 10:30:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 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-03-04 10:30:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-04 10:30:13,235 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2025-03-04 10:30:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:13,235 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-04 10:30:13,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-04 10:30:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:30:13,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:13,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:13,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:30:13,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:13,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1582839066, now seen corresponding path program 1 times [2025-03-04 10:30:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192625209] [2025-03-04 10:30:13,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:13,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:30:13,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:30:13,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192625209] [2025-03-04 10:30:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192625209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:13,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:13,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:30:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060719207] [2025-03-04 10:30:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:13,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:30:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:13,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:30:13,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:30:13,278 INFO L87 Difference]: Start difference. First operand 22 states and 26 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-03-04 10:30:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:13,321 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-04 10:30:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:30:13,321 INFO L78 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 10 [2025-03-04 10:30:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:13,322 INFO L225 Difference]: With dead ends: 35 [2025-03-04 10:30:13,322 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:30:13,322 INFO L434 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-03-04 10:30:13,324 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:13,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:30:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-04 10:30:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-04 10:30:13,330 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2025-03-04 10:30:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:13,330 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-04 10:30:13,330 INFO L472 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-03-04 10:30:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-04 10:30:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:30:13,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:13,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:13,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:30:13,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:13,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:13,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1823228762, now seen corresponding path program 1 times [2025-03-04 10:30:13,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:13,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947624806] [2025-03-04 10:30:13,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:13,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:30:13,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:30:13,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947624806] [2025-03-04 10:30:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947624806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115807245] [2025-03-04 10:30:13,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:13,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:13,376 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-03-04 10:30:13,378 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-03-04 10:30:13,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:30:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:30:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:30:13,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115807245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:13,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:30:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771492844] [2025-03-04 10:30:13,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:13,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:30:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:13,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:30:13,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:30:13,485 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-03-04 10:30:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:13,517 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2025-03-04 10:30:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:30:13,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-03-04 10:30:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:13,518 INFO L225 Difference]: With dead ends: 70 [2025-03-04 10:30:13,518 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 10:30:13,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:30:13,518 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 39 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-03-04 10:30:13,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 39 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 10:30:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-03-04 10:30:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 65 states have internal predecessors, (88), 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-03-04 10:30:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2025-03-04 10:30:13,527 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 11 [2025-03-04 10:30:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:13,527 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2025-03-04 10:30:13,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-03-04 10:30:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2025-03-04 10:30:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:30:13,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:13,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:30:13,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:30:13,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:13,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:13,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1879403440, now seen corresponding path program 1 times [2025-03-04 10:30:13,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:13,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121981293] [2025-03-04 10:30:13,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:13,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:30:13,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:30:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:13,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121981293] [2025-03-04 10:30:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121981293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863143725] [2025-03-04 10:30:13,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:13,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:13,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:13,768 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-03-04 10:30:13,770 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-03-04 10:30:13,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:30:13,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:30:13,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:13,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:13,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:30:13,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863143725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:13,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:13,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:30:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22728860] [2025-03-04 10:30:13,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:13,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:30:13,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:13,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:30:13,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:30:13,831 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:13,855 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2025-03-04 10:30:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:30:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:30:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:13,856 INFO L225 Difference]: With dead ends: 87 [2025-03-04 10:30:13,856 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 10:30:13,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:30:13,857 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:13,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 10:30:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2025-03-04 10:30:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 77 states have internal predecessors, (103), 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-03-04 10:30:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2025-03-04 10:30:13,864 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 11 [2025-03-04 10:30:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:13,864 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2025-03-04 10:30:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2025-03-04 10:30:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:30:13,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:13,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:13,870 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-03-04 10:30:14,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 10:30:14,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:14,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash -87345518, now seen corresponding path program 1 times [2025-03-04 10:30:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350085558] [2025-03-04 10:30:14,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:14,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:30:14,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:30:14,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:14,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:30:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350085558] [2025-03-04 10:30:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350085558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086492939] [2025-03-04 10:30:14,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:14,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:14,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:14,094 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-03-04 10:30:14,096 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-03-04 10:30:14,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:30:14,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:30:14,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:14,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:14,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:30:14,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:14,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:14,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086492939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:14,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:14,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2025-03-04 10:30:14,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692268063] [2025-03-04 10:30:14,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:14,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:30:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:14,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:30:14,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:30:14,181 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:14,272 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2025-03-04 10:30:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:30:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 10:30:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:14,274 INFO L225 Difference]: With dead ends: 129 [2025-03-04 10:30:14,274 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 10:30:14,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:30:14,274 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:14,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 10:30:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2025-03-04 10:30:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.348623853211009) internal successors, (147), 110 states have internal predecessors, (147), 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-03-04 10:30:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 147 transitions. [2025-03-04 10:30:14,292 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 147 transitions. Word has length 13 [2025-03-04 10:30:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:14,292 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 147 transitions. [2025-03-04 10:30:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 147 transitions. [2025-03-04 10:30:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:30:14,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:14,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:14,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:30:14,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:14,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1005200992, now seen corresponding path program 1 times [2025-03-04 10:30:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23669242] [2025-03-04 10:30:14,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:14,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:30:14,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:30:14,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:14,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:30:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23669242] [2025-03-04 10:30:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23669242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625633804] [2025-03-04 10:30:14,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:14,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:14,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:14,530 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-03-04 10:30:14,531 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-03-04 10:30:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:30:14,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:30:14,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:14,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:14,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:30:14,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:14,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625633804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:14,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 12 [2025-03-04 10:30:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526591648] [2025-03-04 10:30:14,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:14,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:30:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:14,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:30:14,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:30:14,658 INFO L87 Difference]: Start difference. First operand 111 states and 147 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:14,804 INFO L93 Difference]: Finished difference Result 211 states and 276 transitions. [2025-03-04 10:30:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:30:14,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 10:30:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:14,806 INFO L225 Difference]: With dead ends: 211 [2025-03-04 10:30:14,806 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 10:30:14,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:30:14,807 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:14,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 48 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 10:30:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 151. [2025-03-04 10:30:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 149 states have (on average 1.348993288590604) internal successors, (201), 150 states have internal predecessors, (201), 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-03-04 10:30:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 201 transitions. [2025-03-04 10:30:14,832 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 201 transitions. Word has length 18 [2025-03-04 10:30:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:14,832 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 201 transitions. [2025-03-04 10:30:14,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 201 transitions. [2025-03-04 10:30:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:30:14,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:14,833 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 10:30:14,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:30:15,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:15,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1720003250, now seen corresponding path program 2 times [2025-03-04 10:30:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411817220] [2025-03-04 10:30:15,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:15,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:30:15,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 23 statements. [2025-03-04 10:30:15,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:30:15,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:30:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411817220] [2025-03-04 10:30:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411817220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:15,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421486334] [2025-03-04 10:30:15,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:15,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:15,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:15,057 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-03-04 10:30:15,058 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-03-04 10:30:15,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:30:15,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 23 statements. [2025-03-04 10:30:15,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:30:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:15,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:30:15,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:30:15,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:30:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421486334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:15,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 10:30:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204693135] [2025-03-04 10:30:15,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:15,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:30:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:15,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:30:15,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:30:15,133 INFO L87 Difference]: Start difference. First operand 151 states and 201 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-03-04 10:30:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:15,150 INFO L93 Difference]: Finished difference Result 151 states and 201 transitions. [2025-03-04 10:30:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:30:15,151 INFO L78 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 23 [2025-03-04 10:30:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:15,151 INFO L225 Difference]: With dead ends: 151 [2025-03-04 10:30:15,152 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 10:30:15,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-03-04 10:30:15,152 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:15,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 10:30:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 52. [2025-03-04 10:30:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 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-03-04 10:30:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2025-03-04 10:30:15,158 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 23 [2025-03-04 10:30:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:15,159 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2025-03-04 10:30:15,159 INFO L472 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-03-04 10:30:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2025-03-04 10:30:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:30:15,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:15,159 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:15,166 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-03-04 10:30:15,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:30:15,364 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash -708875301, now seen corresponding path program 1 times [2025-03-04 10:30:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465974341] [2025-03-04 10:30:15,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:15,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:30:15,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:30:15,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:15,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:15,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:15,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465974341] [2025-03-04 10:30:15,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465974341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:15,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916888461] [2025-03-04 10:30:15,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:15,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:15,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:15,444 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-03-04 10:30:15,446 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-03-04 10:30:15,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:30:15,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:30:15,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:15,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:15,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:30:15,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:15,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916888461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:15,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 10:30:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351279632] [2025-03-04 10:30:15,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:15,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:30:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:15,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:30:15,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:30:15,574 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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-03-04 10:30:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:15,653 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2025-03-04 10:30:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:30:15,653 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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) Word has length 23 [2025-03-04 10:30:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:15,654 INFO L225 Difference]: With dead ends: 136 [2025-03-04 10:30:15,654 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 10:30:15,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:30:15,655 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:15,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 10:30:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 81. [2025-03-04 10:30:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 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-03-04 10:30:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-03-04 10:30:15,670 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 23 [2025-03-04 10:30:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:15,670 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-03-04 10:30:15,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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-03-04 10:30:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-03-04 10:30:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:30:15,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:15,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:30:15,678 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-03-04 10:30:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:15,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1261789950, now seen corresponding path program 2 times [2025-03-04 10:30:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276210831] [2025-03-04 10:30:15,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:15,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:30:15,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:30:15,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:15,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:30:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276210831] [2025-03-04 10:30:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276210831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146582590] [2025-03-04 10:30:15,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:15,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:15,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:15,918 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-03-04 10:30:15,920 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-03-04 10:30:15,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:30:15,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:30:15,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:15,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:15,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:30:15,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:30:15,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:30:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146582590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:15,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:15,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-04 10:30:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502920481] [2025-03-04 10:30:15,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:15,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:30:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:15,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:30:15,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:30:15,983 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-03-04 10:30:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:16,008 INFO L93 Difference]: Finished difference Result 160 states and 204 transitions. [2025-03-04 10:30:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:30:16,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-03-04 10:30:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:16,009 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:30:16,009 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 10:30:16,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:30:16,009 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:16,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 10:30:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2025-03-04 10:30:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 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-03-04 10:30:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-03-04 10:30:16,019 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 28 [2025-03-04 10:30:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:16,019 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-03-04 10:30:16,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-03-04 10:30:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-03-04 10:30:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:30:16,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:16,021 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:16,027 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-03-04 10:30:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:16,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1998859339, now seen corresponding path program 2 times [2025-03-04 10:30:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084189328] [2025-03-04 10:30:16,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:16,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:30:16,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:30:16,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:16,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:30:16,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084189328] [2025-03-04 10:30:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084189328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787270631] [2025-03-04 10:30:16,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:16,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:16,293 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-03-04 10:30:16,295 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-03-04 10:30:16,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:30:16,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:30:16,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:16,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:16,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:30:16,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:30:16,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:30:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787270631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:16,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:30:16,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 10:30:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483866144] [2025-03-04 10:30:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:16,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:30:16,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:16,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:30:16,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:30:16,343 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-03-04 10:30:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:16,367 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2025-03-04 10:30:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:30:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 31 [2025-03-04 10:30:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:16,368 INFO L225 Difference]: With dead ends: 134 [2025-03-04 10:30:16,368 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 10:30:16,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:30:16,368 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:16,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 10:30:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 10:30:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 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-03-04 10:30:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2025-03-04 10:30:16,377 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 31 [2025-03-04 10:30:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:16,377 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-03-04 10:30:16,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-03-04 10:30:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2025-03-04 10:30:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 10:30:16,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:16,378 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:30:16,384 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-03-04 10:30:16,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:30:16,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:16,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2130296416, now seen corresponding path program 3 times [2025-03-04 10:30:16,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:16,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20088826] [2025-03-04 10:30:16,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:16,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 9 equivalence classes. [2025-03-04 10:30:16,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 37 statements. [2025-03-04 10:30:16,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:30:16,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 10:30:16,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20088826] [2025-03-04 10:30:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20088826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675120586] [2025-03-04 10:30:16,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:16,614 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-03-04 10:30:16,615 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-03-04 10:30:16,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 9 equivalence classes. [2025-03-04 10:30:16,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 37 statements. [2025-03-04 10:30:16,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:30:16,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:16,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:30:16,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 10:30:16,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 10:30:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675120586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:16,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:16,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 10:30:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538894102] [2025-03-04 10:30:16,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:16,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:30:16,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:16,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:30:16,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:30:16,741 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:16,777 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2025-03-04 10:30:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:30:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 10:30:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:16,778 INFO L225 Difference]: With dead ends: 102 [2025-03-04 10:30:16,778 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 10:30:16,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:30:16,780 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:16,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 10:30:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 10:30:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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-03-04 10:30:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2025-03-04 10:30:16,784 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 37 [2025-03-04 10:30:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:16,785 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2025-03-04 10:30:16,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2025-03-04 10:30:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:30:16,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:16,786 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:16,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:30:16,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:30:16,987 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:16,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1900854053, now seen corresponding path program 3 times [2025-03-04 10:30:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787217480] [2025-03-04 10:30:16,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:16,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 12 equivalence classes. [2025-03-04 10:30:16,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:30:16,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 10:30:16,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:17,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787217480] [2025-03-04 10:30:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787217480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754930255] [2025-03-04 10:30:17,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:17,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:17,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:17,144 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-03-04 10:30:17,144 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-03-04 10:30:17,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 12 equivalence classes. [2025-03-04 10:30:17,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:30:17,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 10:30:17,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:17,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:30:17,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:17,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754930255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:17,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:17,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-04 10:30:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309495860] [2025-03-04 10:30:17,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:17,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:30:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:17,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:30:17,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=466, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:30:17,442 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 28 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-03-04 10:30:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:17,552 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-03-04 10:30:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:30:17,552 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 28 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) Word has length 41 [2025-03-04 10:30:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:17,553 INFO L225 Difference]: With dead ends: 102 [2025-03-04 10:30:17,553 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 10:30:17,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=466, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:30:17,553 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:17,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 10:30:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-03-04 10:30:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 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-03-04 10:30:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2025-03-04 10:30:17,559 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 41 [2025-03-04 10:30:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:17,559 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2025-03-04 10:30:17,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 28 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-03-04 10:30:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2025-03-04 10:30:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:30:17,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:17,559 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:17,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:30:17,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:30:17,761 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:17,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash 998127323, now seen corresponding path program 4 times [2025-03-04 10:30:17,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:17,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425972126] [2025-03-04 10:30:17,762 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:30:17,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:17,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-03-04 10:30:17,774 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:30:17,778 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:30:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:18,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425972126] [2025-03-04 10:30:18,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425972126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173852225] [2025-03-04 10:30:18,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:30:18,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:18,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:18,178 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-03-04 10:30:18,180 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-03-04 10:30:18,203 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-03-04 10:30:18,218 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:30:18,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:30:18,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:18,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:30:18,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:18,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173852225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:19,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2025-03-04 10:30:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020847143] [2025-03-04 10:30:19,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:19,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 10:30:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:19,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 10:30:19,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1142, Invalid=1510, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:30:19,053 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 52 states have internal predecessors, (152), 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-03-04 10:30:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:19,233 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2025-03-04 10:30:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 10:30:19,233 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 52 states have internal predecessors, (152), 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 77 [2025-03-04 10:30:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:19,234 INFO L225 Difference]: With dead ends: 174 [2025-03-04 10:30:19,234 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 10:30:19,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1142, Invalid=1510, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:30:19,236 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:19,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 10:30:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-03-04 10:30:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 states have internal predecessors, (154), 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-03-04 10:30:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2025-03-04 10:30:19,245 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 77 [2025-03-04 10:30:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:19,246 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2025-03-04 10:30:19,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 52 states have internal predecessors, (152), 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-03-04 10:30:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2025-03-04 10:30:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 10:30:19,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:19,247 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:19,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:30:19,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:30:19,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1537140005, now seen corresponding path program 5 times [2025-03-04 10:30:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:19,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207992004] [2025-03-04 10:30:19,453 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:30:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:19,458 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 149 statements into 48 equivalence classes. [2025-03-04 10:30:19,517 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 10:30:19,517 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-04 10:30:19,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 0 proven. 3152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:20,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207992004] [2025-03-04 10:30:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207992004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:20,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556218080] [2025-03-04 10:30:20,845 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:30:20,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:20,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:20,847 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:30:20,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:30:20,869 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 149 statements into 48 equivalence classes. [2025-03-04 10:30:20,908 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 10:30:20,908 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-04 10:30:20,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:20,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 10:30:20,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 0 proven. 3152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:21,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 0 proven. 3152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556218080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:23,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2025-03-04 10:30:23,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208560131] [2025-03-04 10:30:23,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:23,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-04 10:30:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:23,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-04 10:30:23,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4574, Invalid=5326, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 10:30:23,144 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand has 100 states, 99 states have (on average 2.98989898989899) internal successors, (296), 100 states have internal predecessors, (296), 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-03-04 10:30:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:23,468 INFO L93 Difference]: Finished difference Result 318 states and 369 transitions. [2025-03-04 10:30:23,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-03-04 10:30:23,469 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 2.98989898989899) internal successors, (296), 100 states have internal predecessors, (296), 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 149 [2025-03-04 10:30:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:23,470 INFO L225 Difference]: With dead ends: 318 [2025-03-04 10:30:23,470 INFO L226 Difference]: Without dead ends: 299 [2025-03-04 10:30:23,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4574, Invalid=5326, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 10:30:23,473 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:23,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 35 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:30:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-04 10:30:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-03-04 10:30:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.0067567567567568) internal successors, (298), 296 states have internal predecessors, (298), 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-03-04 10:30:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2025-03-04 10:30:23,488 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 149 [2025-03-04 10:30:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:23,488 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2025-03-04 10:30:23,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 2.98989898989899) internal successors, (296), 100 states have internal predecessors, (296), 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-03-04 10:30:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2025-03-04 10:30:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 10:30:23,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:23,490 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:23,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:30:23,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:30:23,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:23,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1319443749, now seen corresponding path program 6 times [2025-03-04 10:30:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540801813] [2025-03-04 10:30:23,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:30:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:23,701 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 293 statements into 96 equivalence classes. [2025-03-04 10:30:23,788 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 96 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 10:30:23,788 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 96 check-sat command(s) [2025-03-04 10:30:23,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13208 backedges. 0 proven. 13208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540801813] [2025-03-04 10:30:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540801813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156860526] [2025-03-04 10:30:27,640 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:30:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:27,642 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:30:27,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:30:27,671 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 293 statements into 96 equivalence classes. [2025-03-04 10:30:27,751 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 96 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 10:30:27,752 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 96 check-sat command(s) [2025-03-04 10:30:27,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:27,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-04 10:30:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13208 backedges. 0 proven. 13208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:28,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13208 backedges. 0 proven. 13208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:35,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156860526] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:35,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:35,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2025-03-04 10:30:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619449780] [2025-03-04 10:30:35,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:35,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 196 states [2025-03-04 10:30:35,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:35,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2025-03-04 10:30:35,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18350, Invalid=19870, Unknown=0, NotChecked=0, Total=38220 [2025-03-04 10:30:35,098 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand has 196 states, 195 states have (on average 2.994871794871795) internal successors, (584), 196 states have internal predecessors, (584), 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-03-04 10:30:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:35,912 INFO L93 Difference]: Finished difference Result 606 states and 705 transitions. [2025-03-04 10:30:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2025-03-04 10:30:35,913 INFO L78 Accepts]: Start accepts. Automaton has has 196 states, 195 states have (on average 2.994871794871795) internal successors, (584), 196 states have internal predecessors, (584), 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 293 [2025-03-04 10:30:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:35,915 INFO L225 Difference]: With dead ends: 606 [2025-03-04 10:30:35,915 INFO L226 Difference]: Without dead ends: 587 [2025-03-04 10:30:35,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=18350, Invalid=19870, Unknown=0, NotChecked=0, Total=38220 [2025-03-04 10:30:35,918 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:35,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 49 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:30:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-04 10:30:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2025-03-04 10:30:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.0034246575342465) internal successors, (586), 584 states have internal predecessors, (586), 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-03-04 10:30:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2025-03-04 10:30:35,942 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 293 [2025-03-04 10:30:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:35,942 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 586 transitions. [2025-03-04 10:30:35,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 196 states, 195 states have (on average 2.994871794871795) internal successors, (584), 196 states have internal predecessors, (584), 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-03-04 10:30:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 586 transitions. [2025-03-04 10:30:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-04 10:30:35,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:35,948 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:35,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:30:36,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:36,149 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:30:36,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1474399525, now seen corresponding path program 7 times [2025-03-04 10:30:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:36,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693003004] [2025-03-04 10:30:36,149 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:30:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:36,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-04 10:30:36,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-04 10:30:36,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:36,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 54056 backedges. 0 proven. 54056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:50,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:50,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693003004] [2025-03-04 10:30:50,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693003004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:50,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412604350] [2025-03-04 10:30:50,595 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:30:50,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:50,596 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:30:50,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:30:50,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-04 10:30:50,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-04 10:30:50,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:50,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:50,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 194 conjuncts are in the unsatisfiable core [2025-03-04 10:30:50,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 54056 backedges. 0 proven. 54056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:51,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:31:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 54056 backedges. 0 proven. 54056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:31:18,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412604350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:31:18,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:31:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [194, 194, 194] total 387 [2025-03-04 10:31:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742344357] [2025-03-04 10:31:18,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:31:18,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 388 states [2025-03-04 10:31:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:31:18,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 388 interpolants. [2025-03-04 10:31:18,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73550, Invalid=76606, Unknown=0, NotChecked=0, Total=150156 [2025-03-04 10:31:18,776 INFO L87 Difference]: Start difference. First operand 585 states and 586 transitions. Second operand has 388 states, 387 states have (on average 2.9974160206718348) internal successors, (1160), 388 states have internal predecessors, (1160), 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-03-04 10:31:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:31:22,772 INFO L93 Difference]: Finished difference Result 1182 states and 1377 transitions. [2025-03-04 10:31:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 388 states. [2025-03-04 10:31:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 388 states, 387 states have (on average 2.9974160206718348) internal successors, (1160), 388 states have internal predecessors, (1160), 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 581 [2025-03-04 10:31:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:31:22,777 INFO L225 Difference]: With dead ends: 1182 [2025-03-04 10:31:22,777 INFO L226 Difference]: Without dead ends: 1163 [2025-03-04 10:31:22,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1354 GetRequests, 968 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=73550, Invalid=76606, Unknown=0, NotChecked=0, Total=150156 [2025-03-04 10:31:22,782 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:31:22,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:31:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-03-04 10:31:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2025-03-04 10:31:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1160 states have (on average 1.0017241379310344) internal successors, (1162), 1160 states have internal predecessors, (1162), 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-03-04 10:31:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1162 transitions. [2025-03-04 10:31:22,834 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1162 transitions. Word has length 581 [2025-03-04 10:31:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:31:22,835 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1162 transitions. [2025-03-04 10:31:22,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 388 states, 387 states have (on average 2.9974160206718348) internal successors, (1160), 388 states have internal predecessors, (1160), 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-03-04 10:31:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1162 transitions. [2025-03-04 10:31:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2025-03-04 10:31:22,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:31:22,862 INFO L218 NwaCegarLoop]: trace histogram [382, 382, 382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:31:22,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:31:23,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:31:23,063 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:31:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:31:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1998220581, now seen corresponding path program 8 times [2025-03-04 10:31:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:31:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571806245] [2025-03-04 10:31:23,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:31:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:31:23,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1157 statements into 2 equivalence classes. [2025-03-04 10:31:23,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1157 of 1157 statements. [2025-03-04 10:31:23,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:31:23,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat