./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.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/LexIndexValue-Array-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:28:20,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:28:20,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:28:20,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:28:20,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:28:20,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:28:20,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:28:20,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:28:20,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:28:20,750 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:28:20,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:28:20,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:28:20,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:28:20,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:28:20,752 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:28:20,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:28:20,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:28:20,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:28:20,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:28:20,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:28:20,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:28:20,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:20,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:28:20,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:28:20,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:28:20,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:28:20,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:28:20,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:28:20,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:28:20,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:28:20,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:28:20,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:28:20,755 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 -> d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff [2025-03-04 10:28:20,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:28:20,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:28:20,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:28:20,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:28:20,995 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:28:20,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2025-03-04 10:28:22,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11b0ff1a/bbdd0e59217c4e34aa6f88d61e289de8/FLAGf58c47e91 [2025-03-04 10:28:22,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:28:22,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2025-03-04 10:28:22,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11b0ff1a/bbdd0e59217c4e34aa6f88d61e289de8/FLAGf58c47e91 [2025-03-04 10:28:22,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11b0ff1a/bbdd0e59217c4e34aa6f88d61e289de8 [2025-03-04 10:28:22,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:28:22,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:28:22,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:22,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:28:22,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:28:22,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45151ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22, skipping insertion in model container [2025-03-04 10:28:22,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:28:22,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:22,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:28:22,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:22,544 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:28:22,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22 WrapperNode [2025-03-04 10:28:22,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:22,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:22,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:28:22,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:28:22,550 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:28:22" (1/1) ... [2025-03-04 10:28:22,555 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:28:22" (1/1) ... [2025-03-04 10:28:22,567 INFO L138 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2025-03-04 10:28:22,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:22,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:28:22,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:28:22,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:28:22,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,586 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 10:28:22,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:28:22,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:28:22,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:28:22,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:28:22,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (1/1) ... [2025-03-04 10:28:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:22,629 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:28:22,632 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:28:22,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:28:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:28:22,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:28:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:28:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:28:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:28:22,703 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:28:22,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:28:22,800 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-04 10:28:22,809 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 10:28:22,809 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:28:22,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:28:22,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:28:22,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:22 BoogieIcfgContainer [2025-03-04 10:28:22,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:28:22,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:28:22,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:28:22,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:28:22,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:28:22" (1/3) ... [2025-03-04 10:28:22,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4a3c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:22, skipping insertion in model container [2025-03-04 10:28:22,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:22" (2/3) ... [2025-03-04 10:28:22,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4a3c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:22, skipping insertion in model container [2025-03-04 10:28:22,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:22" (3/3) ... [2025-03-04 10:28:22,824 INFO L128 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Array-1.c [2025-03-04 10:28:22,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:28:22,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LexIndexValue-Array-1.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-04 10:28:22,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:28:22,888 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;@6febc34f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:28:22,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:28:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:28:22,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:22,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:28:22,900 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:28:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1815231, now seen corresponding path program 1 times [2025-03-04 10:28:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918540270] [2025-03-04 10:28:22,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:22,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:22,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:28:22,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:28:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:22,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:23,080 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:28:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918540270] [2025-03-04 10:28:23,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918540270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:23,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:23,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:28:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186746814] [2025-03-04 10:28:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:23,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:28:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:23,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:28:23,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:23,105 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:28:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:23,149 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-04 10:28:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:28:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-04 10:28:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:23,157 INFO L225 Difference]: With dead ends: 44 [2025-03-04 10:28:23,158 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 10:28:23,160 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:28:23,162 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:23,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 10:28:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-04 10:28:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) 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:28:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 10:28:23,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 4 [2025-03-04 10:28:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:23,193 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 10:28:23,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:28:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 10:28:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:28:23,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:23,194 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:28:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:28:23,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1757034952, now seen corresponding path program 1 times [2025-03-04 10:28:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:23,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678029902] [2025-03-04 10:28:23,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:23,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:28:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:28:23,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:23,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:23,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678029902] [2025-03-04 10:28:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678029902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:23,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801017088] [2025-03-04 10:28:23,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:23,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:23,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:23,313 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:28:23,313 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:28:23,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:28:23,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:28:23,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:23,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:23,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:28:23,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:23,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:28:23,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801017088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:23,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:28:23,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:28:23,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987886970] [2025-03-04 10:28:23,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:23,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:23,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:23,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:28:23,398 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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:28:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:23,424 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-03-04 10:28:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:28:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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:28:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:23,425 INFO L225 Difference]: With dead ends: 22 [2025-03-04 10:28:23,425 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 10:28:23,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:28:23,426 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:23,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 10:28:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 10:28:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 10:28:23,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2025-03-04 10:28:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:23,428 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 10:28:23,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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:28:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 10:28:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:28:23,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:23,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 10:28:23,435 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:28:23,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:23,634 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:28:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1366491329, now seen corresponding path program 1 times [2025-03-04 10:28:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938265113] [2025-03-04 10:28:23,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:23,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:28:23,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:28:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:23,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:28:23,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:23,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938265113] [2025-03-04 10:28:23,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938265113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:23,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:23,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031528539] [2025-03-04 10:28:23,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:23,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:23,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:23,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:23,697 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:23,708 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-03-04 10:28:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:28:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:23,710 INFO L225 Difference]: With dead ends: 21 [2025-03-04 10:28:23,710 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 10:28:23,710 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:28:23,711 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:23,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 10:28:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-04 10:28:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 17 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:28:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-04 10:28:23,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 8 [2025-03-04 10:28:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:23,714 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-04 10:28:23,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-03-04 10:28:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:28:23,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:23,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:23,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:28:23,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:23,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1295225237, now seen corresponding path program 1 times [2025-03-04 10:28:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:23,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376286370] [2025-03-04 10:28:23,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:23,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:28:23,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:28:23,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:23,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:23,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376286370] [2025-03-04 10:28:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376286370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175353522] [2025-03-04 10:28:23,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:23,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:23,797 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:28:23,799 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:28:23,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:28:23,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:28:23,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:23,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:23,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:28:23,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:23,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175353522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:23,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:28:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254662473] [2025-03-04 10:28:23,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:23,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:28:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:23,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:28:23,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:28:23,909 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:23,937 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-04 10:28:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:28:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:23,938 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:28:23,938 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:28:23,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:28:23,938 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:23,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:28:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 10:28:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-04 10:28:23,945 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2025-03-04 10:28:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:23,945 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-04 10:28:23,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-04 10:28:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:28:23,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:23,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:23,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:28:24,146 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,SelfDestructingSolverStorable3 [2025-03-04 10:28:24,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:24,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2037177291, now seen corresponding path program 2 times [2025-03-04 10:28:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320354747] [2025-03-04 10:28:24,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:24,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:28:24,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 17 statements. [2025-03-04 10:28:24,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:28:24,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:28:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320354747] [2025-03-04 10:28:24,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320354747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:24,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:24,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:28:24,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370860996] [2025-03-04 10:28:24,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:24,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:28:24,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:24,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:28:24,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:24,202 INFO L87 Difference]: Start difference. First operand 24 states and 27 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:28:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:24,227 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-04 10:28:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:28:24,228 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 17 [2025-03-04 10:28:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:24,228 INFO L225 Difference]: With dead ends: 35 [2025-03-04 10:28:24,228 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 10:28:24,228 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:28:24,229 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:24,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 10:28:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2025-03-04 10:28:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-04 10:28:24,235 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2025-03-04 10:28:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:24,235 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-04 10:28:24,235 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:28:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-04 10:28:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:28:24,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:24,236 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:24,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:28:24,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:24,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2037177131, now seen corresponding path program 1 times [2025-03-04 10:28:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:24,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142062701] [2025-03-04 10:28:24,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:24,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:24,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:28:24,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:28:24,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:24,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:28:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142062701] [2025-03-04 10:28:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142062701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:24,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:28:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698175824] [2025-03-04 10:28:24,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:28:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:24,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:28:24,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:28:24,335 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:28:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:24,369 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2025-03-04 10:28:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:28:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 17 [2025-03-04 10:28:24,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:24,370 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:28:24,370 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:28:24,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:24,371 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 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:28:24,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:28:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 10:28:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 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:28:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-04 10:28:24,377 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2025-03-04 10:28:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:24,377 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-04 10:28:24,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:28:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-04 10:28:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:28:24,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:24,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:24,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:28:24,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:24,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1272013393, now seen corresponding path program 1 times [2025-03-04 10:28:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491152001] [2025-03-04 10:28:24,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:24,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:28:24,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:28:24,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:24,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:28:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491152001] [2025-03-04 10:28:24,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491152001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:24,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:24,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:28:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123872255] [2025-03-04 10:28:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:24,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:28:24,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:24,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:28:24,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:24,424 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:24,444 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-04 10:28:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:28:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 10:28:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:24,445 INFO L225 Difference]: With dead ends: 33 [2025-03-04 10:28:24,445 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:28:24,445 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:28:24,445 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 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:28:24,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:28:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-04 10:28:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 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:28:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-04 10:28:24,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 18 [2025-03-04 10:28:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:24,448 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-04 10:28:24,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-04 10:28:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:28:24,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:24,450 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:24,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:28:24,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:24,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1272018358, now seen corresponding path program 1 times [2025-03-04 10:28:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:24,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076452087] [2025-03-04 10:28:24,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:24,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:28:24,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:28:24,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:24,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:24,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076452087] [2025-03-04 10:28:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076452087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030269964] [2025-03-04 10:28:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:24,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:24,543 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:28:24,552 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:28:24,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:28:24,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:28:24,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:24,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:24,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:28:24,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:24,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030269964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:24,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 10:28:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582028544] [2025-03-04 10:28:24,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:24,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:28:24,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:24,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:28:24,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:28:24,721 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:24,756 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2025-03-04 10:28:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:28:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 10:28:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:24,757 INFO L225 Difference]: With dead ends: 62 [2025-03-04 10:28:24,757 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 10:28:24,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:28:24,758 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:24,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 10:28:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 10:28:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 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:28:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-04 10:28:24,761 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2025-03-04 10:28:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:24,761 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-04 10:28:24,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-04 10:28:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:28:24,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:24,762 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:24,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:24,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:24,966 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:28:24,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash -763273098, now seen corresponding path program 2 times [2025-03-04 10:28:24,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:24,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944433738] [2025-03-04 10:28:24,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:24,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:28:24,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:28:24,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:24,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:25,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944433738] [2025-03-04 10:28:25,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944433738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879382537] [2025-03-04 10:28:25,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:25,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:25,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:25,201 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:28:25,203 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:28:25,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:28:25,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:28:25,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:25,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:25,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:28:25,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:25,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879382537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:25,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:25,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 10:28:25,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102732472] [2025-03-04 10:28:25,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:25,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:28:25,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:25,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:28:25,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:28:25,559 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:25,627 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2025-03-04 10:28:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 10:28:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 10:28:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:25,628 INFO L225 Difference]: With dead ends: 86 [2025-03-04 10:28:25,628 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 10:28:25,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:28:25,629 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:25,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 10:28:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 10:28:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.140625) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-03-04 10:28:25,634 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 30 [2025-03-04 10:28:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:25,634 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-03-04 10:28:25,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-03-04 10:28:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:28:25,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:25,635 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:25,641 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:28:25,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:25,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:25,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash -449653258, now seen corresponding path program 3 times [2025-03-04 10:28:25,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:25,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147779064] [2025-03-04 10:28:25,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:25,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:25,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 16 equivalence classes. [2025-03-04 10:28:25,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:28:25,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-04 10:28:25,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:26,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147779064] [2025-03-04 10:28:26,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147779064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:26,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039640724] [2025-03-04 10:28:26,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:26,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:26,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:26,465 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:28:26,470 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:28:26,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 16 equivalence classes. [2025-03-04 10:28:26,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:28:26,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-04 10:28:26,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:26,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:28:26,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:26,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:27,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039640724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:27,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:27,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2025-03-04 10:28:27,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35452263] [2025-03-04 10:28:27,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:27,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-04 10:28:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:27,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-04 10:28:27,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 10:28:27,541 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 66 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 66 states have internal predecessors, (105), 0 states have call successors, (0), 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:28:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:27,643 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2025-03-04 10:28:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 10:28:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 66 states have internal predecessors, (105), 0 states have call successors, (0), 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 54 [2025-03-04 10:28:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:27,644 INFO L225 Difference]: With dead ends: 134 [2025-03-04 10:28:27,644 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 10:28:27,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 10:28:27,646 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:27,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 10:28:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 10:28:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 114 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2025-03-04 10:28:27,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 54 [2025-03-04 10:28:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:27,662 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2025-03-04 10:28:27,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 66 states have internal predecessors, (105), 0 states have call successors, (0), 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:28:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2025-03-04 10:28:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 10:28:27,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:27,664 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:27,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:28:27,864 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,SelfDestructingSolverStorable9 [2025-03-04 10:28:27,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:27,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1793310474, now seen corresponding path program 4 times [2025-03-04 10:28:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446069703] [2025-03-04 10:28:27,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:27,888 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-03-04 10:28:27,917 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 10:28:27,920 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:27,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446069703] [2025-03-04 10:28:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446069703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909649755] [2025-03-04 10:28:29,915 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:29,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:29,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:29,917 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:28:29,918 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:28:29,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-03-04 10:28:30,008 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 10:28:30,009 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:30,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:30,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 10:28:30,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:30,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909649755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:32,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2025-03-04 10:28:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948300920] [2025-03-04 10:28:32,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:32,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2025-03-04 10:28:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:32,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2025-03-04 10:28:32,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2025-03-04 10:28:32,393 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 130 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 130 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:28:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:32,602 INFO L93 Difference]: Finished difference Result 230 states and 273 transitions. [2025-03-04 10:28:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-03-04 10:28:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 130 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) Word has length 102 [2025-03-04 10:28:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:32,604 INFO L225 Difference]: With dead ends: 230 [2025-03-04 10:28:32,604 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 10:28:32,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5206 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2025-03-04 10:28:32,607 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:32,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:28:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 10:28:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-04 10:28:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 208 states have (on average 1.0432692307692308) internal successors, (217), 210 states have internal predecessors, (217), 0 states have call successors, (0), 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:28:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 217 transitions. [2025-03-04 10:28:32,615 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 217 transitions. Word has length 102 [2025-03-04 10:28:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:32,615 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 217 transitions. [2025-03-04 10:28:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 130 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:28:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 217 transitions. [2025-03-04 10:28:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 10:28:32,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:32,617 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:32,623 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:28:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:32,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1995893002, now seen corresponding path program 5 times [2025-03-04 10:28:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:32,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958033031] [2025-03-04 10:28:32,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:28:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:32,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 198 statements into 64 equivalence classes. [2025-03-04 10:28:33,195 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 64 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 10:28:33,196 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 64 check-sat command(s) [2025-03-04 10:28:33,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958033031] [2025-03-04 10:28:38,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958033031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162587252] [2025-03-04 10:28:38,614 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:28:38,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:38,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:38,616 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:28:38,616 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:28:38,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 198 statements into 64 equivalence classes.