./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/nla-digbench-scaling/ps5-ll_valuebound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash a7db00fa220927f51e1e342e06102a5d28a1c61268049ef86f9068e213c9adb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:23:52,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:23:52,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:23:52,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:23:52,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:23:53,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:23:53,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:23:53,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:23:53,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:23:53,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:23:53,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:23:53,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:23:53,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:23:53,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:23:53,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:23:53,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:23:53,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:23:53,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:23:53,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:23:53,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:23:53,019 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7db00fa220927f51e1e342e06102a5d28a1c61268049ef86f9068e213c9adb5 [2025-03-04 11:23:53,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:23:53,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:23:53,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:23:53,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:23:53,214 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:23:53,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c [2025-03-04 11:23:54,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e3d5180/551420ea170a484389904319e938b48d/FLAG36757800d [2025-03-04 11:23:54,457 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:23:54,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c [2025-03-04 11:23:54,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e3d5180/551420ea170a484389904319e938b48d/FLAG36757800d [2025-03-04 11:23:54,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e3d5180/551420ea170a484389904319e938b48d [2025-03-04 11:23:54,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:23:54,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:23:54,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:23:54,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:23:54,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:23:54,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:54,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533709be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54, skipping insertion in model container [2025-03-04 11:23:54,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:54,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:23:54,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:23:54,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:23:54,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:23:54,965 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:23:54,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54 WrapperNode [2025-03-04 11:23:54,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:23:54,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:23:54,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:23:54,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:23:54,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:54,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:54,989 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-03-04 11:23:54,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:23:54,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:23:54,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:23:54,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:23:54,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:54,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:54,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,004 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:23:55,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:23:55,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:23:55,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:23:55,010 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:23:55,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (1/1) ... [2025-03-04 11:23:55,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:23:55,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:55,042 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 11:23:55,047 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 11:23:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:23:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:23:55,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:23:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:23:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:23:55,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:23:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:23:55,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:23:55,104 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:23:55,105 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:23:55,450 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-04 11:23:55,450 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:23:55,463 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:23:55,464 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:23:55,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:23:55 BoogieIcfgContainer [2025-03-04 11:23:55,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:23:55,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:23:55,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:23:55,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:23:55,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:23:54" (1/3) ... [2025-03-04 11:23:55,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6826ed99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:23:55, skipping insertion in model container [2025-03-04 11:23:55,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:54" (2/3) ... [2025-03-04 11:23:55,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6826ed99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:23:55, skipping insertion in model container [2025-03-04 11:23:55,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:23:55" (3/3) ... [2025-03-04 11:23:55,473 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound50.c [2025-03-04 11:23:55,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:23:55,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_valuebound50.c that has 3 procedures, 191 locations, 1 initial locations, 1 loop locations, and 84 error locations. [2025-03-04 11:23:55,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:23:55,535 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;@28429f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:23:55,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-03-04 11:23:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:23:55,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:55,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:55,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:55,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:55,547 INFO L85 PathProgramCache]: Analyzing trace with hash 444888282, now seen corresponding path program 1 times [2025-03-04 11:23:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359749963] [2025-03-04 11:23:55,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:55,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:23:55,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:23:55,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:55,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:23:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359749963] [2025-03-04 11:23:55,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359749963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:23:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725803567] [2025-03-04 11:23:55,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:55,645 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 11:23:55,646 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 11:23:55,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:23:55,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:23:55,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:55,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:55,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:23:55,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:23:55,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:23:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725803567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:23:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:23:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811643733] [2025-03-04 11:23:55,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:55,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:23:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:55,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:23:55,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:23:55,703 INFO L87 Difference]: Start difference. First operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:23:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:55,724 INFO L93 Difference]: Finished difference Result 365 states and 394 transitions. [2025-03-04 11:23:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:23:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 11:23:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:55,730 INFO L225 Difference]: With dead ends: 365 [2025-03-04 11:23:55,731 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 11:23:55,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:23:55,736 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:55,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:23:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 11:23:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-04 11:23:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:23:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2025-03-04 11:23:55,763 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2025-03-04 11:23:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:55,763 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2025-03-04 11:23:55,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:23:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2025-03-04 11:23:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:23:55,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:55,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:55,769 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 11:23:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:23:55,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:55,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash 249298298, now seen corresponding path program 1 times [2025-03-04 11:23:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:55,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949035810] [2025-03-04 11:23:55,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:55,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:23:55,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:23:55,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:56,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949035810] [2025-03-04 11:23:56,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949035810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:56,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:56,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195315615] [2025-03-04 11:23:56,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:56,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:56,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:56,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:56,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:56,030 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:56,315 INFO L93 Difference]: Finished difference Result 307 states and 319 transitions. [2025-03-04 11:23:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:56,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-03-04 11:23:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:56,316 INFO L225 Difference]: With dead ends: 307 [2025-03-04 11:23:56,316 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 11:23:56,317 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 11:23:56,317 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:56,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 125 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:23:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 11:23:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2025-03-04 11:23:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 167 states have (on average 1.5089820359281436) internal successors, (252), 237 states have internal predecessors, (252), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 262 transitions. [2025-03-04 11:23:56,330 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 262 transitions. Word has length 14 [2025-03-04 11:23:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:56,331 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 262 transitions. [2025-03-04 11:23:56,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 262 transitions. [2025-03-04 11:23:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:23:56,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:56,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:56,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:23:56,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:56,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 277918430, now seen corresponding path program 1 times [2025-03-04 11:23:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229569380] [2025-03-04 11:23:56,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:56,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:23:56,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:23:56,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:56,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229569380] [2025-03-04 11:23:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229569380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:56,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:56,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:56,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522965769] [2025-03-04 11:23:56,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:56,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:56,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:56,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:56,428 INFO L87 Difference]: Start difference. First operand 245 states and 262 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:56,486 INFO L93 Difference]: Finished difference Result 264 states and 276 transitions. [2025-03-04 11:23:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:56,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-04 11:23:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:56,488 INFO L225 Difference]: With dead ends: 264 [2025-03-04 11:23:56,488 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 11:23:56,488 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 11:23:56,489 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:56,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 294 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:23:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 11:23:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2025-03-04 11:23:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4885057471264367) internal successors, (259), 244 states have internal predecessors, (259), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 269 transitions. [2025-03-04 11:23:56,509 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 269 transitions. Word has length 42 [2025-03-04 11:23:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:56,509 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 269 transitions. [2025-03-04 11:23:56,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 269 transitions. [2025-03-04 11:23:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:23:56,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:56,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:56,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:23:56,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:56,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash 791641628, now seen corresponding path program 1 times [2025-03-04 11:23:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:56,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272254173] [2025-03-04 11:23:56,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:56,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:56,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:23:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:23:56,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:56,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272254173] [2025-03-04 11:23:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272254173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:56,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200551817] [2025-03-04 11:23:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:56,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:56,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:56,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:56,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:56,603 INFO L87 Difference]: Start difference. First operand 252 states and 269 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:56,734 INFO L93 Difference]: Finished difference Result 263 states and 271 transitions. [2025-03-04 11:23:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:56,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-04 11:23:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:56,736 INFO L225 Difference]: With dead ends: 263 [2025-03-04 11:23:56,736 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 11:23:56,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:56,736 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 132 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:56,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 231 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:23:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 11:23:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2025-03-04 11:23:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4597701149425288) internal successors, (254), 244 states have internal predecessors, (254), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2025-03-04 11:23:56,750 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 44 [2025-03-04 11:23:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:56,751 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2025-03-04 11:23:56,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2025-03-04 11:23:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:23:56,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:56,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:56,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:23:56,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:56,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1228913226, now seen corresponding path program 1 times [2025-03-04 11:23:56,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:56,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955141130] [2025-03-04 11:23:56,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:56,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:56,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:23:56,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:23:56,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:56,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955141130] [2025-03-04 11:23:56,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955141130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:56,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552357952] [2025-03-04 11:23:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:56,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:56,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:56,817 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:57,104 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2025-03-04 11:23:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 11:23:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:57,105 INFO L225 Difference]: With dead ends: 262 [2025-03-04 11:23:57,105 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 11:23:57,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:57,106 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 81 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:57,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:23:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 11:23:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2025-03-04 11:23:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.542857142857143) internal successors, (216), 210 states have internal predecessors, (216), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 226 transitions. [2025-03-04 11:23:57,116 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 226 transitions. Word has length 45 [2025-03-04 11:23:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:57,116 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 226 transitions. [2025-03-04 11:23:57,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 226 transitions. [2025-03-04 11:23:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:23:57,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:57,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:57,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:23:57,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:57,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash -218506347, now seen corresponding path program 1 times [2025-03-04 11:23:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:57,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967314117] [2025-03-04 11:23:57,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:57,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:23:57,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:23:57,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:57,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967314117] [2025-03-04 11:23:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967314117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:57,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:57,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754562247] [2025-03-04 11:23:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:57,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:57,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:57,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:57,160 INFO L87 Difference]: Start difference. First operand 218 states and 226 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:57,173 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2025-03-04 11:23:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2025-03-04 11:23:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:57,175 INFO L225 Difference]: With dead ends: 220 [2025-03-04 11:23:57,175 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 11:23:57,175 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 11:23:57,175 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:57,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:23:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 11:23:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 11:23:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 210 states have internal predecessors, (214), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2025-03-04 11:23:57,181 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 54 [2025-03-04 11:23:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:57,181 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2025-03-04 11:23:57,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2025-03-04 11:23:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:23:57,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:57,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:57,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:23:57,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1203634290, now seen corresponding path program 1 times [2025-03-04 11:23:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732257395] [2025-03-04 11:23:57,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:57,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:23:57,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:23:57,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:57,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1419098801] [2025-03-04 11:23:57,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:57,201 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 11:23:57,202 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 11:23:57,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:23:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:23:57,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:57,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:23:57,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:57,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:23:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732257395] [2025-03-04 11:23:57,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:23:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419098801] [2025-03-04 11:23:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419098801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:57,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723663512] [2025-03-04 11:23:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:57,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:57,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:57,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:57,337 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:57,629 INFO L93 Difference]: Finished difference Result 356 states and 372 transitions. [2025-03-04 11:23:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:57,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-03-04 11:23:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:57,630 INFO L225 Difference]: With dead ends: 356 [2025-03-04 11:23:57,630 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 11:23:57,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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 11:23:57,631 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:57,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 149 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:23:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 11:23:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2025-03-04 11:23:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4074074074074074) internal successors, (304), 286 states have internal predecessors, (304), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 318 transitions. [2025-03-04 11:23:57,638 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 318 transitions. Word has length 59 [2025-03-04 11:23:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:57,639 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 318 transitions. [2025-03-04 11:23:57,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 318 transitions. [2025-03-04 11:23:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:23:57,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:57,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:57,645 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 11:23:57,840 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,SelfDestructingSolverStorable6 [2025-03-04 11:23:57,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash -609393688, now seen corresponding path program 1 times [2025-03-04 11:23:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:57,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124939665] [2025-03-04 11:23:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:57,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:23:57,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:23:57,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:57,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:57,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:57,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124939665] [2025-03-04 11:23:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124939665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:57,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314892991] [2025-03-04 11:23:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:57,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:57,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:57,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:57,921 INFO L87 Difference]: Start difference. First operand 296 states and 318 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:57,986 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2025-03-04 11:23:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2025-03-04 11:23:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:57,987 INFO L225 Difference]: With dead ends: 297 [2025-03-04 11:23:57,988 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:23:57,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:57,988 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:57,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:23:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:23:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 11:23:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4027777777777777) internal successors, (303), 286 states have internal predecessors, (303), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 317 transitions. [2025-03-04 11:23:57,994 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 317 transitions. Word has length 65 [2025-03-04 11:23:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:57,994 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 317 transitions. [2025-03-04 11:23:57,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 317 transitions. [2025-03-04 11:23:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 11:23:57,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:57,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:57,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:23:57,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2104697332, now seen corresponding path program 1 times [2025-03-04 11:23:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018326491] [2025-03-04 11:23:57,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:58,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:23:58,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:23:58,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:58,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111831797] [2025-03-04 11:23:58,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:58,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:58,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:58,018 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 11:23:58,019 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 11:23:58,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:23:58,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:23:58,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:58,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:58,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:23:58,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 11:23:58,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:23:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018326491] [2025-03-04 11:23:58,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:23:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111831797] [2025-03-04 11:23:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111831797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386312069] [2025-03-04 11:23:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:58,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:58,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:58,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:58,175 INFO L87 Difference]: Start difference. First operand 296 states and 317 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:58,216 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2025-03-04 11:23:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 94 [2025-03-04 11:23:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:58,217 INFO L225 Difference]: With dead ends: 296 [2025-03-04 11:23:58,217 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 11:23:58,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 SyntacticMatches, 1 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 11:23:58,218 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:58,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:23:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 11:23:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-04 11:23:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 1.3796296296296295) internal successors, (298), 283 states have internal predecessors, (298), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 312 transitions. [2025-03-04 11:23:58,228 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 312 transitions. Word has length 94 [2025-03-04 11:23:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:58,228 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 312 transitions. [2025-03-04 11:23:58,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 312 transitions. [2025-03-04 11:23:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:23:58,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:58,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:58,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:23:58,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:58,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash -821107766, now seen corresponding path program 1 times [2025-03-04 11:23:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125891289] [2025-03-04 11:23:58,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:58,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:23:58,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:23:58,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:58,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147449018] [2025-03-04 11:23:58,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:58,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:58,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:58,454 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 11:23:58,454 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 11:23:58,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:23:58,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:23:58,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:58,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:58,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:23:58,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:58,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:23:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125891289] [2025-03-04 11:23:58,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:23:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147449018] [2025-03-04 11:23:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147449018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:23:58,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:23:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:23:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478450078] [2025-03-04 11:23:58,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:23:58,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:23:58,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:58,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:23:58,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:23:58,837 INFO L87 Difference]: Start difference. First operand 293 states and 312 transitions. Second operand has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:23:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:59,379 INFO L93 Difference]: Finished difference Result 364 states and 379 transitions. [2025-03-04 11:23:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:23:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 95 [2025-03-04 11:23:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:59,381 INFO L225 Difference]: With dead ends: 364 [2025-03-04 11:23:59,381 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 11:23:59,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:23:59,382 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 285 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:59,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 310 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:23:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 11:23:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 330. [2025-03-04 11:23:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 254 states have (on average 1.4015748031496063) internal successors, (356), 320 states have internal predecessors, (356), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 370 transitions. [2025-03-04 11:23:59,389 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 370 transitions. Word has length 95 [2025-03-04 11:23:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:59,389 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 370 transitions. [2025-03-04 11:23:59,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:23:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 370 transitions. [2025-03-04 11:23:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 11:23:59,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:59,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:59,395 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 11:23:59,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:59,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:59,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 315463114, now seen corresponding path program 1 times [2025-03-04 11:23:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:59,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656143127] [2025-03-04 11:23:59,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:59,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:23:59,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:23:59,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:59,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930087063] [2025-03-04 11:23:59,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:59,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:59,627 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 11:23:59,629 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 11:23:59,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:23:59,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:23:59,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:59,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:59,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:23:59,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:59,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:00,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:00,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656143127] [2025-03-04 11:24:00,604 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:00,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930087063] [2025-03-04 11:24:00,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930087063] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:00,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:00,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-03-04 11:24:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858552509] [2025-03-04 11:24:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:00,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:24:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:00,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:24:00,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:24:00,605 INFO L87 Difference]: Start difference. First operand 330 states and 370 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:03,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:07,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:11,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:15,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:18,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:20,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:23,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:25,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:28,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:30,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:32,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:35,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:35,307 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2025-03-04 11:24:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:35,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 96 [2025-03-04 11:24:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:35,308 INFO L225 Difference]: With dead ends: 330 [2025-03-04 11:24:35,308 INFO L226 Difference]: Without dead ends: 328 [2025-03-04 11:24:35,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:35,309 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 145 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:35,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 81 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 482 Invalid, 3 Unknown, 0 Unchecked, 34.7s Time] [2025-03-04 11:24:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-04 11:24:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-04 11:24:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 254 states have (on average 1.3858267716535433) internal successors, (352), 318 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 366 transitions. [2025-03-04 11:24:35,317 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 366 transitions. Word has length 96 [2025-03-04 11:24:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:35,317 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 366 transitions. [2025-03-04 11:24:35,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 366 transitions. [2025-03-04 11:24:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 11:24:35,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:35,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:35,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:35,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:24:35,522 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1189422024, now seen corresponding path program 1 times [2025-03-04 11:24:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042407314] [2025-03-04 11:24:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:35,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:24:35,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:24:35,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:35,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881647758] [2025-03-04 11:24:35,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:35,548 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 11:24:35,549 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 11:24:35,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:24:35,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:24:35,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:35,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:35,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:24:35,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:35,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042407314] [2025-03-04 11:24:35,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881647758] [2025-03-04 11:24:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881647758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:24:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199518407] [2025-03-04 11:24:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:35,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:35,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:35,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:35,720 INFO L87 Difference]: Start difference. First operand 328 states and 366 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:35,951 INFO L93 Difference]: Finished difference Result 328 states and 366 transitions. [2025-03-04 11:24:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2025-03-04 11:24:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:35,953 INFO L225 Difference]: With dead ends: 328 [2025-03-04 11:24:35,953 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 11:24:35,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:35,954 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 200 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:35,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 46 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 11:24:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-04 11:24:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 254 states have (on average 1.2677165354330708) internal successors, (322), 298 states have internal predecessors, (322), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 336 transitions. [2025-03-04 11:24:35,963 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 336 transitions. Word has length 97 [2025-03-04 11:24:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:35,964 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 336 transitions. [2025-03-04 11:24:35,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 336 transitions. [2025-03-04 11:24:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 11:24:35,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:35,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:35,970 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 11:24:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:36,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:36,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1782622840, now seen corresponding path program 1 times [2025-03-04 11:24:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25447342] [2025-03-04 11:24:36,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:36,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 11:24:36,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:24:36,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:36,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:36,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196470105] [2025-03-04 11:24:36,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:36,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:36,187 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 11:24:36,189 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 11:24:36,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 11:24:36,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:24:36,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:36,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:36,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:24:36,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:36,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 11:24:36,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25447342] [2025-03-04 11:24:36,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196470105] [2025-03-04 11:24:36,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196470105] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:36,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:36,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 11:24:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635592080] [2025-03-04 11:24:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:36,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:36,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:36,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:36,601 INFO L87 Difference]: Start difference. First operand 308 states and 336 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:39,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:43,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:49,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:50,376 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2025-03-04 11:24:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:50,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2025-03-04 11:24:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:50,378 INFO L225 Difference]: With dead ends: 308 [2025-03-04 11:24:50,378 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 11:24:50,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:50,378 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:50,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 55 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 1 Unknown, 0 Unchecked, 13.8s Time] [2025-03-04 11:24:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 11:24:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-04 11:24:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 254 states have (on average 1.2519685039370079) internal successors, (318), 296 states have internal predecessors, (318), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 332 transitions. [2025-03-04 11:24:50,388 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 332 transitions. Word has length 98 [2025-03-04 11:24:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 332 transitions. [2025-03-04 11:24:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 332 transitions. [2025-03-04 11:24:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:24:50,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:50,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:50,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:24:50,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:50,591 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:50,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash 681095619, now seen corresponding path program 1 times [2025-03-04 11:24:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524641227] [2025-03-04 11:24:50,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:50,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:24:50,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:24:50,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:50,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:50,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:50,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524641227] [2025-03-04 11:24:50,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524641227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963417529] [2025-03-04 11:24:50,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:50,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:50,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:50,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:24:50,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:24:50,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:24:50,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:50,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:50,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:24:50,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:50,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:50,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963417529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:50,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:50,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:24:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030027055] [2025-03-04 11:24:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:50,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:50,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:50,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:50,812 INFO L87 Difference]: Start difference. First operand 306 states and 332 transitions. Second operand has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:24:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:50,830 INFO L93 Difference]: Finished difference Result 306 states and 332 transitions. [2025-03-04 11:24:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:50,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 106 [2025-03-04 11:24:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:50,832 INFO L225 Difference]: With dead ends: 306 [2025-03-04 11:24:50,832 INFO L226 Difference]: Without dead ends: 305 [2025-03-04 11:24:50,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:50,832 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:50,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 347 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-04 11:24:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-04 11:24:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 254 states have (on average 1.2440944881889764) internal successors, (316), 295 states have internal predecessors, (316), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 330 transitions. [2025-03-04 11:24:50,840 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 330 transitions. Word has length 106 [2025-03-04 11:24:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:50,840 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 330 transitions. [2025-03-04 11:24:50,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:24:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 330 transitions. [2025-03-04 11:24:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:24:50,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:50,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:50,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:24:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:24:51,042 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:51,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash -360872220, now seen corresponding path program 1 times [2025-03-04 11:24:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:51,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925133529] [2025-03-04 11:24:51,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:51,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:24:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:24:51,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:51,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925133529] [2025-03-04 11:24:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925133529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874302542] [2025-03-04 11:24:51,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:51,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:51,123 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:51,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:24:51,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:24:51,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:24:51,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:51,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:51,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:24:51,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:51,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874302542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:51,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:24:51,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:24:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299988009] [2025-03-04 11:24:51,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:51,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:24:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:51,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:24:51,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:51,313 INFO L87 Difference]: Start difference. First operand 305 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 11:24:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:51,348 INFO L93 Difference]: Finished difference Result 403 states and 416 transitions. [2025-03-04 11:24:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:51,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 107 [2025-03-04 11:24:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:51,350 INFO L225 Difference]: With dead ends: 403 [2025-03-04 11:24:51,350 INFO L226 Difference]: Without dead ends: 402 [2025-03-04 11:24:51,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:51,350 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:51,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 729 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-04 11:24:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 361. [2025-03-04 11:24:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 308 states have (on average 1.2824675324675325) internal successors, (395), 349 states have internal predecessors, (395), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 413 transitions. [2025-03-04 11:24:51,360 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 413 transitions. Word has length 107 [2025-03-04 11:24:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:51,360 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 413 transitions. [2025-03-04 11:24:51,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 11:24:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 413 transitions. [2025-03-04 11:24:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:24:51,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:51,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:51,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:51,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:24:51,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:51,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1248322858, now seen corresponding path program 1 times [2025-03-04 11:24:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665874928] [2025-03-04 11:24:51,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:51,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:24:51,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:24:51,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:51,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 11:24:51,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:51,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665874928] [2025-03-04 11:24:51,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665874928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:51,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:51,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:51,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997674332] [2025-03-04 11:24:51,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:51,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:51,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:51,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:51,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:51,630 INFO L87 Difference]: Start difference. First operand 361 states and 413 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:51,770 INFO L93 Difference]: Finished difference Result 361 states and 413 transitions. [2025-03-04 11:24:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:24:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2025-03-04 11:24:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:51,772 INFO L225 Difference]: With dead ends: 361 [2025-03-04 11:24:51,772 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 11:24:51,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:51,772 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:51,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 53 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 11:24:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 11:24:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 308 states have (on average 1.2370129870129871) internal successors, (381), 342 states have internal predecessors, (381), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 399 transitions. [2025-03-04 11:24:51,782 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 399 transitions. Word has length 118 [2025-03-04 11:24:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 399 transitions. [2025-03-04 11:24:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 399 transitions. [2025-03-04 11:24:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 11:24:51,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:51,783 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:51,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:24:51,783 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -43302792, now seen corresponding path program 1 times [2025-03-04 11:24:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776546250] [2025-03-04 11:24:51,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:51,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:24:51,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:24:51,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:51,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:24:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776546250] [2025-03-04 11:24:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776546250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:51,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:51,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282958496] [2025-03-04 11:24:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:51,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:51,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:51,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:51,831 INFO L87 Difference]: Start difference. First operand 354 states and 399 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:51,938 INFO L93 Difference]: Finished difference Result 354 states and 399 transitions. [2025-03-04 11:24:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:51,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 119 [2025-03-04 11:24:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:51,939 INFO L225 Difference]: With dead ends: 354 [2025-03-04 11:24:51,939 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 11:24:51,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:51,940 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:51,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 40 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 11:24:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-04 11:24:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 341 states have internal predecessors, (378), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 396 transitions. [2025-03-04 11:24:51,949 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 396 transitions. Word has length 119 [2025-03-04 11:24:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:51,950 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 396 transitions. [2025-03-04 11:24:51,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 396 transitions. [2025-03-04 11:24:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 11:24:51,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:51,950 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:24:51,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:51,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1335694326, now seen corresponding path program 1 times [2025-03-04 11:24:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284941632] [2025-03-04 11:24:51,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:51,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 11:24:51,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 11:24:51,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:51,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334994709] [2025-03-04 11:24:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:51,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:51,966 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:51,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:24:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 11:24:52,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 11:24:52,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:52,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:52,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:24:52,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:52,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284941632] [2025-03-04 11:24:52,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334994709] [2025-03-04 11:24:52,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334994709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:52,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:52,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:24:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557472313] [2025-03-04 11:24:52,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:52,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:24:52,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:52,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:24:52,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:52,254 INFO L87 Difference]: Start difference. First operand 353 states and 396 transitions. Second operand has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:24:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:52,648 INFO L93 Difference]: Finished difference Result 414 states and 449 transitions. [2025-03-04 11:24:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:24:52,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 121 [2025-03-04 11:24:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:52,650 INFO L225 Difference]: With dead ends: 414 [2025-03-04 11:24:52,650 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 11:24:52,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:52,651 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 417 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:52,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 158 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:24:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 11:24:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 337. [2025-03-04 11:24:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.1683501683501682) internal successors, (347), 326 states have internal predecessors, (347), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 363 transitions. [2025-03-04 11:24:52,660 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 363 transitions. Word has length 121 [2025-03-04 11:24:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:52,661 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 363 transitions. [2025-03-04 11:24:52,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:24:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 363 transitions. [2025-03-04 11:24:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 11:24:52,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:52,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:52,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:52,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:24:52,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1237571047, now seen corresponding path program 1 times [2025-03-04 11:24:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261945762] [2025-03-04 11:24:52,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:52,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 11:24:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 11:24:52,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:52,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:52,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091995248] [2025-03-04 11:24:52,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:52,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:52,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:52,888 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:52,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:24:52,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 11:24:52,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 11:24:52,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:52,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:52,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:24:52,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:53,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:53,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:53,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261945762] [2025-03-04 11:24:53,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:53,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091995248] [2025-03-04 11:24:53,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091995248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:53,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:53,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 11:24:53,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883870401] [2025-03-04 11:24:53,393 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:53,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:53,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:53,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:53,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:53,394 INFO L87 Difference]: Start difference. First operand 337 states and 363 transitions. Second operand has 5 states, 4 states have (on average 31.5) internal successors, (126), 5 states have internal predecessors, (126), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:24:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:53,549 INFO L93 Difference]: Finished difference Result 337 states and 363 transitions. [2025-03-04 11:24:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.5) internal successors, (126), 5 states have internal predecessors, (126), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 145 [2025-03-04 11:24:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:53,550 INFO L225 Difference]: With dead ends: 337 [2025-03-04 11:24:53,550 INFO L226 Difference]: Without dead ends: 323 [2025-03-04 11:24:53,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:53,551 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:53,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 58 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-04 11:24:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2025-03-04 11:24:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 294 states have (on average 1.098639455782313) internal successors, (323), 309 states have internal predecessors, (323), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 339 transitions. [2025-03-04 11:24:53,559 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 339 transitions. Word has length 145 [2025-03-04 11:24:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:53,560 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 339 transitions. [2025-03-04 11:24:53,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.5) internal successors, (126), 5 states have internal predecessors, (126), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:24:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 339 transitions. [2025-03-04 11:24:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 11:24:53,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:53,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:53,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:24:53,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:53,761 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:53,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -290003229, now seen corresponding path program 1 times [2025-03-04 11:24:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063767131] [2025-03-04 11:24:53,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:53,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 11:24:53,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:24:53,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:53,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015466619] [2025-03-04 11:24:53,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:53,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:53,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:53,782 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:53,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:24:53,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 11:24:53,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:24:53,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:53,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:53,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:24:53,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:54,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063767131] [2025-03-04 11:24:54,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015466619] [2025-03-04 11:24:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015466619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:54,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:24:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594552532] [2025-03-04 11:24:54,315 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:54,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:24:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:54,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:24:54,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:54,316 INFO L87 Difference]: Start difference. First operand 320 states and 339 transitions. Second operand has 6 states, 5 states have (on average 25.4) internal successors, (127), 6 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:54,530 INFO L93 Difference]: Finished difference Result 358 states and 377 transitions. [2025-03-04 11:24:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:54,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.4) internal successors, (127), 6 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2025-03-04 11:24:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:54,532 INFO L225 Difference]: With dead ends: 358 [2025-03-04 11:24:54,532 INFO L226 Difference]: Without dead ends: 320 [2025-03-04 11:24:54,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:54,533 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:54,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-04 11:24:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-03-04 11:24:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 294 states have (on average 1.0952380952380953) internal successors, (322), 309 states have internal predecessors, (322), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 338 transitions. [2025-03-04 11:24:54,541 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 338 transitions. Word has length 146 [2025-03-04 11:24:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:54,541 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 338 transitions. [2025-03-04 11:24:54,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.4) internal successors, (127), 6 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 338 transitions. [2025-03-04 11:24:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 11:24:54,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:54,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:54,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:24:54,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:54,743 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash -491992368, now seen corresponding path program 1 times [2025-03-04 11:24:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655804481] [2025-03-04 11:24:54,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:54,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 11:24:54,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 11:24:54,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:54,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:54,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710594042] [2025-03-04 11:24:54,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:54,770 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:54,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:24:54,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 11:24:54,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 11:24:54,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:54,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:54,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:24:54,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:54,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:54,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655804481] [2025-03-04 11:24:54,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710594042] [2025-03-04 11:24:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710594042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:54,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:54,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:24:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874939166] [2025-03-04 11:24:54,982 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:24:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:54,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:24:54,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:54,983 INFO L87 Difference]: Start difference. First operand 320 states and 338 transitions. Second operand has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:55,217 INFO L93 Difference]: Finished difference Result 376 states and 396 transitions. [2025-03-04 11:24:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 165 [2025-03-04 11:24:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:55,219 INFO L225 Difference]: With dead ends: 376 [2025-03-04 11:24:55,219 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 11:24:55,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:55,219 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 152 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:55,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 92 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 11:24:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 320. [2025-03-04 11:24:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 294 states have (on average 1.0850340136054422) internal successors, (319), 309 states have internal predecessors, (319), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 335 transitions. [2025-03-04 11:24:55,228 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 335 transitions. Word has length 165 [2025-03-04 11:24:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:55,228 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 335 transitions. [2025-03-04 11:24:55,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 335 transitions. [2025-03-04 11:24:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 11:24:55,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:55,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:55,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:55,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 11:24:55,434 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:55,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -358261266, now seen corresponding path program 1 times [2025-03-04 11:24:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510584890] [2025-03-04 11:24:55,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:55,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 11:24:55,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:24:55,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:55,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324761599] [2025-03-04 11:24:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:55,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:55,459 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:55,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:24:55,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 11:24:55,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:24:55,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:55,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:55,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:24:55,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:55,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510584890] [2025-03-04 11:24:55,902 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324761599] [2025-03-04 11:24:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324761599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:55,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:55,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 11:24:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954913897] [2025-03-04 11:24:55,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:55,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:24:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:55,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:24:55,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:55,903 INFO L87 Difference]: Start difference. First operand 320 states and 335 transitions. Second operand has 10 states, 9 states have (on average 32.0) internal successors, (288), 10 states have internal predecessors, (288), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:24:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:56,390 INFO L93 Difference]: Finished difference Result 393 states and 414 transitions. [2025-03-04 11:24:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:24:56,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 32.0) internal successors, (288), 10 states have internal predecessors, (288), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 167 [2025-03-04 11:24:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:56,395 INFO L225 Difference]: With dead ends: 393 [2025-03-04 11:24:56,395 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 11:24:56,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:24:56,396 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 626 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:56,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 207 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:24:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 11:24:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 307. [2025-03-04 11:24:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 288 states have (on average 1.0451388888888888) internal successors, (301), 296 states have internal predecessors, (301), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 317 transitions. [2025-03-04 11:24:56,406 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 317 transitions. Word has length 167 [2025-03-04 11:24:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:56,406 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 317 transitions. [2025-03-04 11:24:56,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 32.0) internal successors, (288), 10 states have internal predecessors, (288), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:24:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 317 transitions. [2025-03-04 11:24:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 11:24:56,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:56,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:56,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:56,613 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:56,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash -691691252, now seen corresponding path program 1 times [2025-03-04 11:24:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911575383] [2025-03-04 11:24:56,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:56,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 11:24:56,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 11:24:56,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:56,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612015404] [2025-03-04 11:24:56,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:56,638 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:56,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:24:56,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 11:24:56,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 11:24:56,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:56,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:56,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:24:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:56,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:57,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911575383] [2025-03-04 11:24:57,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:57,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612015404] [2025-03-04 11:24:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612015404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:57,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:57,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 11:24:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140538032] [2025-03-04 11:24:57,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:57,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:24:57,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:57,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:24:57,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:24:57,222 INFO L87 Difference]: Start difference. First operand 307 states and 317 transitions. Second operand has 14 states, 13 states have (on average 22.46153846153846) internal successors, (292), 14 states have internal predecessors, (292), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:24:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:58,088 INFO L93 Difference]: Finished difference Result 546 states and 578 transitions. [2025-03-04 11:24:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:24:58,089 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 22.46153846153846) internal successors, (292), 14 states have internal predecessors, (292), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 169 [2025-03-04 11:24:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:58,091 INFO L225 Difference]: With dead ends: 546 [2025-03-04 11:24:58,091 INFO L226 Difference]: Without dead ends: 545 [2025-03-04 11:24:58,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=179, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:24:58,092 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 344 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:58,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 210 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:24:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-04 11:24:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 413. [2025-03-04 11:24:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 392 states have (on average 1.0612244897959184) internal successors, (416), 400 states have internal predecessors, (416), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:24:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 436 transitions. [2025-03-04 11:24:58,105 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 436 transitions. Word has length 169 [2025-03-04 11:24:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:58,105 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 436 transitions. [2025-03-04 11:24:58,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 22.46153846153846) internal successors, (292), 14 states have internal predecessors, (292), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:24:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 436 transitions. [2025-03-04 11:24:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 11:24:58,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:58,106 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:58,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:58,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:58,307 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:58,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:58,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1064524817, now seen corresponding path program 2 times [2025-03-04 11:24:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:58,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761034883] [2025-03-04 11:24:58,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:58,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 198 statements into 2 equivalence classes. [2025-03-04 11:24:58,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 11:24:58,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:24:58,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518752035] [2025-03-04 11:24:58,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:58,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:58,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:58,331 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:58,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:24:58,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 198 statements into 2 equivalence classes. [2025-03-04 11:24:58,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 198 statements. [2025-03-04 11:24:58,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:24:58,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:58,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:24:58,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 11:24:58,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:58,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761034883] [2025-03-04 11:24:58,896 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:58,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518752035] [2025-03-04 11:24:58,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518752035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:58,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:58,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:24:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980795383] [2025-03-04 11:24:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:58,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:58,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:58,898 INFO L87 Difference]: Start difference. First operand 413 states and 436 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:24:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:58,993 INFO L93 Difference]: Finished difference Result 413 states and 436 transitions. [2025-03-04 11:24:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 198 [2025-03-04 11:24:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:58,995 INFO L225 Difference]: With dead ends: 413 [2025-03-04 11:24:58,995 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 11:24:58,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:58,995 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:58,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 47 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 11:24:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 11:24:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 338 states have (on average 1.0414201183431953) internal successors, (352), 342 states have internal predecessors, (352), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 370 transitions. [2025-03-04 11:24:59,007 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 370 transitions. Word has length 198 [2025-03-04 11:24:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:59,007 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 370 transitions. [2025-03-04 11:24:59,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:24:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 370 transitions. [2025-03-04 11:24:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-04 11:24:59,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:59,008 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:59,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:24:59,209 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1197831698, now seen corresponding path program 2 times [2025-03-04 11:24:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923093300] [2025-03-04 11:24:59,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:59,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 11:24:59,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 11:24:59,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:24:59,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:59,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124895151] [2025-03-04 11:24:59,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:59,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:59,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:59,234 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:59,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:24:59,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 11:24:59,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 11:24:59,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:24:59,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:59,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:24:59,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 6 proven. 234 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 11:24:59,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 6 proven. 234 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 11:25:01,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923093300] [2025-03-04 11:25:01,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124895151] [2025-03-04 11:25:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124895151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:01,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2025-03-04 11:25:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875223323] [2025-03-04 11:25:01,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:01,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:25:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:01,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:25:01,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:25:01,350 INFO L87 Difference]: Start difference. First operand 354 states and 370 transitions. Second operand has 20 states, 19 states have (on average 18.789473684210527) internal successors, (357), 20 states have internal predecessors, (357), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:25:04,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:08,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:14,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.88s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:15,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:25:18,557 INFO L93 Difference]: Finished difference Result 441 states and 459 transitions. [2025-03-04 11:25:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:25:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 18.789473684210527) internal successors, (357), 20 states have internal predecessors, (357), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 199 [2025-03-04 11:25:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:25:18,562 INFO L225 Difference]: With dead ends: 441 [2025-03-04 11:25:18,562 INFO L226 Difference]: Without dead ends: 439 [2025-03-04 11:25:18,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=703, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:25:18,563 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 241 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:25:18,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 300 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1797 Invalid, 2 Unknown, 0 Unchecked, 16.7s Time] [2025-03-04 11:25:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-04 11:25:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 432. [2025-03-04 11:25:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 415 states have (on average 1.03855421686747) internal successors, (431), 419 states have internal predecessors, (431), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:25:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 451 transitions. [2025-03-04 11:25:18,586 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 451 transitions. Word has length 199 [2025-03-04 11:25:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:25:18,593 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 451 transitions. [2025-03-04 11:25:18,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 18.789473684210527) internal successors, (357), 20 states have internal predecessors, (357), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:25:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 451 transitions. [2025-03-04 11:25:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-04 11:25:18,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:25:18,594 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:25:18,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:25:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:18,794 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:25:18,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:25:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 428298774, now seen corresponding path program 1 times [2025-03-04 11:25:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:25:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536909951] [2025-03-04 11:25:18,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:25:18,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 11:25:18,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 11:25:18,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:18,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:25:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325527524] [2025-03-04 11:25:18,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:25:18,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:25:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:25:18,822 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:25:18,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:25:18,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 11:25:18,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 11:25:18,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:25:18,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:25:18,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:25:18,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:25:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 9 proven. 320 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 11:25:19,060 INFO L312 TraceCheckSpWp]: Computing backward predicates...