./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-2.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/psyco/psyco_abp_1-2.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 167b835a28653099821c6834c1cc6b8e30303efac27d569b21e43e89592d7586 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:37:58,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:37:58,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:37:58,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:37:58,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:37:58,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:37:58,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:37:58,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:37:58,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:37:58,771 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:37:58,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:37:58,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:37:58,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:37:58,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:37:58,772 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:37:58,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:37:58,773 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:37:58,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:37:58,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:37:58,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:37:58,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:37:58,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:37:58,776 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 -> 167b835a28653099821c6834c1cc6b8e30303efac27d569b21e43e89592d7586 [2025-03-04 10:37:58,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:37:59,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:37:59,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:37:59,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:37:59,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:37:59,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-2.c [2025-03-04 10:38:00,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5f7baa3/5269fca3174341bb85bb777c7105944c/FLAG499df8d52 [2025-03-04 10:38:00,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:38:00,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-2.c [2025-03-04 10:38:00,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5f7baa3/5269fca3174341bb85bb777c7105944c/FLAG499df8d52 [2025-03-04 10:38:00,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5f7baa3/5269fca3174341bb85bb777c7105944c [2025-03-04 10:38:00,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:38:00,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:38:00,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:38:00,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:38:00,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:38:00,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f78254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00, skipping insertion in model container [2025-03-04 10:38:00,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:38:00,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:38:00,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:38:00,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:38:00,695 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:38:00,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00 WrapperNode [2025-03-04 10:38:00,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:38:00,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:38:00,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:38:00,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:38:00,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,746 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2025-03-04 10:38:00,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:38:00,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:38:00,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:38:00,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:38:00,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,774 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 10:38:00,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:38:00,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:38:00,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:38:00,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:38:00,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (1/1) ... [2025-03-04 10:38:00,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:38:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:00,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:38:00,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:38:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:38:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:38:00,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:38:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:38:00,891 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:38:00,892 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:38:01,487 INFO L? ?]: Removed 327 outVars from TransFormulas that were not future-live. [2025-03-04 10:38:01,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:38:01,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:38:01,501 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:38:01,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:38:01 BoogieIcfgContainer [2025-03-04 10:38:01,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:38:01,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:38:01,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:38:01,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:38:01,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:38:00" (1/3) ... [2025-03-04 10:38:01,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8ea5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:38:01, skipping insertion in model container [2025-03-04 10:38:01,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:38:00" (2/3) ... [2025-03-04 10:38:01,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8ea5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:38:01, skipping insertion in model container [2025-03-04 10:38:01,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:38:01" (3/3) ... [2025-03-04 10:38:01,510 INFO L128 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-2.c [2025-03-04 10:38:01,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:38:01,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_abp_1-2.c that has 1 procedures, 195 locations, 1 initial locations, 1 loop locations, and 42 error locations. [2025-03-04 10:38:01,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:38:01,568 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;@ba6cb4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:38:01,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-04 10:38:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 152 states have (on average 1.9473684210526316) internal successors, (296), 194 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:38:01,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:01,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:01,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:01,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:01,579 INFO L85 PathProgramCache]: Analyzing trace with hash -993619158, now seen corresponding path program 1 times [2025-03-04 10:38:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297991389] [2025-03-04 10:38:01,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:01,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:38:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:38:01,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:01,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297991389] [2025-03-04 10:38:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297991389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733086439] [2025-03-04 10:38:01,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:01,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:01,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:01,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:01,739 INFO L87 Difference]: Start difference. First operand has 195 states, 152 states have (on average 1.9473684210526316) internal successors, (296), 194 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:01,790 INFO L93 Difference]: Finished difference Result 390 states and 594 transitions. [2025-03-04 10:38:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:38:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:01,798 INFO L225 Difference]: With dead ends: 390 [2025-03-04 10:38:01,798 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 10:38:01,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:01,802 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 4 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:01,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 559 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 10:38:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-04 10:38:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 124 states have (on average 1.685483870967742) internal successors, (209), 165 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2025-03-04 10:38:01,829 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 10 [2025-03-04 10:38:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:01,829 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2025-03-04 10:38:01,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2025-03-04 10:38:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:38:01,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:01,830 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:01,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:38:01,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash 646463112, now seen corresponding path program 1 times [2025-03-04 10:38:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495045647] [2025-03-04 10:38:01,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:01,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:38:01,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:38:01,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:01,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:01,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495045647] [2025-03-04 10:38:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495045647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:01,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:01,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:38:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197503079] [2025-03-04 10:38:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:01,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:01,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:01,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:01,923 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:02,054 INFO L93 Difference]: Finished difference Result 321 states and 407 transitions. [2025-03-04 10:38:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:38:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:02,056 INFO L225 Difference]: With dead ends: 321 [2025-03-04 10:38:02,058 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 10:38:02,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:02,059 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 151 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:02,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 326 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 10:38:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 252. [2025-03-04 10:38:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 210 states have (on average 1.6238095238095238) internal successors, (341), 251 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 341 transitions. [2025-03-04 10:38:02,078 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 341 transitions. Word has length 15 [2025-03-04 10:38:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:02,079 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 341 transitions. [2025-03-04 10:38:02,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 341 transitions. [2025-03-04 10:38:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:38:02,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:02,079 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:02,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:38:02,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1519194042, now seen corresponding path program 1 times [2025-03-04 10:38:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100282870] [2025-03-04 10:38:02,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:02,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:38:02,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:38:02,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:02,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:02,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:02,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100282870] [2025-03-04 10:38:02,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100282870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:02,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:02,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:38:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814103107] [2025-03-04 10:38:02,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:02,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:02,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:02,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:02,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:02,140 INFO L87 Difference]: Start difference. First operand 252 states and 341 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:02,201 INFO L93 Difference]: Finished difference Result 355 states and 487 transitions. [2025-03-04 10:38:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 10:38:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:02,204 INFO L225 Difference]: With dead ends: 355 [2025-03-04 10:38:02,204 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 10:38:02,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:02,205 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 123 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:02,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 381 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 10:38:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2025-03-04 10:38:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 300 states have (on average 1.5766666666666667) internal successors, (473), 341 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 473 transitions. [2025-03-04 10:38:02,215 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 473 transitions. Word has length 17 [2025-03-04 10:38:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:02,215 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 473 transitions. [2025-03-04 10:38:02,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 473 transitions. [2025-03-04 10:38:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:38:02,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:02,216 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:02,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:38:02,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:02,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1176987279, now seen corresponding path program 1 times [2025-03-04 10:38:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:02,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294149779] [2025-03-04 10:38:02,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:02,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:38:02,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:38:02,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:02,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:38:02,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:02,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294149779] [2025-03-04 10:38:02,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294149779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:02,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:02,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051475018] [2025-03-04 10:38:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:02,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:02,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:02,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:02,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:02,319 INFO L87 Difference]: Start difference. First operand 342 states and 473 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:02,351 INFO L93 Difference]: Finished difference Result 696 states and 970 transitions. [2025-03-04 10:38:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:02,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 10:38:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:02,355 INFO L225 Difference]: With dead ends: 696 [2025-03-04 10:38:02,355 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 10:38:02,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:02,356 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 39 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:02,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 354 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 10:38:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-04 10:38:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 315 states have (on average 1.5492063492063493) internal successors, (488), 356 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 488 transitions. [2025-03-04 10:38:02,374 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 488 transitions. Word has length 25 [2025-03-04 10:38:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:02,374 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 488 transitions. [2025-03-04 10:38:02,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 488 transitions. [2025-03-04 10:38:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:38:02,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:02,377 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 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 10:38:02,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:38:02,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:02,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash -273435888, now seen corresponding path program 1 times [2025-03-04 10:38:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:02,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749349874] [2025-03-04 10:38:02,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:02,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:38:02,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:38:02,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:02,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749349874] [2025-03-04 10:38:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749349874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49661832] [2025-03-04 10:38:02,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:02,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:02,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:02,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:38:02,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:38:02,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:38:02,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:38:02,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:02,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:38:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49661832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:02,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:38:02,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:38:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541136827] [2025-03-04 10:38:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:02,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:38:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:02,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:38:02,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:38:02,561 INFO L87 Difference]: Start difference. First operand 357 states and 488 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:02,648 INFO L93 Difference]: Finished difference Result 366 states and 494 transitions. [2025-03-04 10:38:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:38:02,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 10:38:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:02,649 INFO L225 Difference]: With dead ends: 366 [2025-03-04 10:38:02,649 INFO L226 Difference]: Without dead ends: 349 [2025-03-04 10:38:02,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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 10:38:02,650 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 278 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:02,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 394 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-04 10:38:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 340. [2025-03-04 10:38:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 315 states have (on average 1.4952380952380953) internal successors, (471), 339 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 471 transitions. [2025-03-04 10:38:02,657 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 471 transitions. Word has length 28 [2025-03-04 10:38:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:02,657 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 471 transitions. [2025-03-04 10:38:02,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 471 transitions. [2025-03-04 10:38:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:38:02,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:02,658 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 10:38:02,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:02,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:02,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:02,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash 113421230, now seen corresponding path program 1 times [2025-03-04 10:38:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403355372] [2025-03-04 10:38:02,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:02,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:38:02,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:38:02,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:02,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:38:02,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:02,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403355372] [2025-03-04 10:38:02,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403355372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:02,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403275249] [2025-03-04 10:38:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:02,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:02,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:02,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:02,897 INFO L87 Difference]: Start difference. First operand 340 states and 471 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:02,909 INFO L93 Difference]: Finished difference Result 680 states and 942 transitions. [2025-03-04 10:38:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:02,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 10:38:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:02,911 INFO L225 Difference]: With dead ends: 680 [2025-03-04 10:38:02,911 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 10:38:02,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:02,913 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:02,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 10:38:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-04 10:38:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 315 states have (on average 1.4857142857142858) internal successors, (468), 339 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 468 transitions. [2025-03-04 10:38:02,933 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 468 transitions. Word has length 29 [2025-03-04 10:38:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:02,933 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 468 transitions. [2025-03-04 10:38:02,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 468 transitions. [2025-03-04 10:38:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:38:02,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:02,934 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 10:38:02,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:38:02,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:02,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:02,934 INFO L85 PathProgramCache]: Analyzing trace with hash 113422291, now seen corresponding path program 1 times [2025-03-04 10:38:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:02,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500148389] [2025-03-04 10:38:02,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:02,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:38:02,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:38:02,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:02,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500148389] [2025-03-04 10:38:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500148389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142334840] [2025-03-04 10:38:02,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:02,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:38:03,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:38:03,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:38:03,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:03,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:03,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:38:03,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:03,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:03,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142334840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:03,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:03,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:38:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712292542] [2025-03-04 10:38:03,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:03,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:38:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:03,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:38:03,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:38:03,114 INFO L87 Difference]: Start difference. First operand 340 states and 468 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:03,228 INFO L93 Difference]: Finished difference Result 485 states and 667 transitions. [2025-03-04 10:38:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:38:03,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 10:38:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:03,230 INFO L225 Difference]: With dead ends: 485 [2025-03-04 10:38:03,230 INFO L226 Difference]: Without dead ends: 416 [2025-03-04 10:38:03,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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 10:38:03,231 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 815 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:03,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 436 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-04 10:38:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 394. [2025-03-04 10:38:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 384 states have (on average 1.4869791666666667) internal successors, (571), 393 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 571 transitions. [2025-03-04 10:38:03,241 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 571 transitions. Word has length 29 [2025-03-04 10:38:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:03,241 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 571 transitions. [2025-03-04 10:38:03,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 571 transitions. [2025-03-04 10:38:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:38:03,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:03,243 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 10:38:03,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:03,443 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 10:38:03,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:03,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:03,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1624646477, now seen corresponding path program 1 times [2025-03-04 10:38:03,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:03,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792587113] [2025-03-04 10:38:03,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:03,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:03,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:38:03,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:38:03,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:03,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792587113] [2025-03-04 10:38:03,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792587113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415197339] [2025-03-04 10:38:03,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:03,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:03,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:03,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:03,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:38:03,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:38:03,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:38:03,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:03,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:38:03,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:03,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415197339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:03,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:03,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:38:03,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579972612] [2025-03-04 10:38:03,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:03,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:38:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:03,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:38:03,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:38:03,646 INFO L87 Difference]: Start difference. First operand 394 states and 571 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:03,742 INFO L93 Difference]: Finished difference Result 691 states and 1009 transitions. [2025-03-04 10:38:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:38:03,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 10:38:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:03,744 INFO L225 Difference]: With dead ends: 691 [2025-03-04 10:38:03,744 INFO L226 Difference]: Without dead ends: 683 [2025-03-04 10:38:03,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:38:03,745 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 961 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:03,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 738 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-04 10:38:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 576. [2025-03-04 10:38:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 570 states have (on average 1.4578947368421054) internal successors, (831), 575 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 831 transitions. [2025-03-04 10:38:03,754 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 831 transitions. Word has length 31 [2025-03-04 10:38:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:03,754 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 831 transitions. [2025-03-04 10:38:03,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 831 transitions. [2025-03-04 10:38:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:38:03,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:03,755 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 10:38:03,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:03,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:03,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:03,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1175566547, now seen corresponding path program 1 times [2025-03-04 10:38:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738423132] [2025-03-04 10:38:03,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:03,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:38:03,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:38:03,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:03,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:04,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738423132] [2025-03-04 10:38:04,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738423132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11063099] [2025-03-04 10:38:04,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:04,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:04,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:04,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:04,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:38:04,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:38:04,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:38:04,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:04,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:04,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:38:04,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:04,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11063099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:04,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:38:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030959752] [2025-03-04 10:38:04,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:04,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:38:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:04,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:38:04,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:38:04,129 INFO L87 Difference]: Start difference. First operand 576 states and 831 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:04,176 INFO L93 Difference]: Finished difference Result 676 states and 973 transitions. [2025-03-04 10:38:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:38:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 10:38:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:04,178 INFO L225 Difference]: With dead ends: 676 [2025-03-04 10:38:04,178 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 10:38:04,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:38:04,180 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 598 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:04,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 257 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 10:38:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 291. [2025-03-04 10:38:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 289 states have (on average 1.4359861591695502) internal successors, (415), 290 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 415 transitions. [2025-03-04 10:38:04,188 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 415 transitions. Word has length 32 [2025-03-04 10:38:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:04,188 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 415 transitions. [2025-03-04 10:38:04,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 415 transitions. [2025-03-04 10:38:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:38:04,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:04,190 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 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] [2025-03-04 10:38:04,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:04,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:04,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:04,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1309762652, now seen corresponding path program 1 times [2025-03-04 10:38:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128261559] [2025-03-04 10:38:04,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:04,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:04,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:38:04,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:38:04,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:04,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:38:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:04,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128261559] [2025-03-04 10:38:04,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128261559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:04,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:04,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255311351] [2025-03-04 10:38:04,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:04,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:04,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:04,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,440 INFO L87 Difference]: Start difference. First operand 291 states and 415 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:04,459 INFO L93 Difference]: Finished difference Result 510 states and 730 transitions. [2025-03-04 10:38:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-04 10:38:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:04,460 INFO L225 Difference]: With dead ends: 510 [2025-03-04 10:38:04,461 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 10:38:04,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,462 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 22 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:04,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 10:38:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-04 10:38:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 1.4181818181818182) internal successors, (312), 221 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 312 transitions. [2025-03-04 10:38:04,466 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 312 transitions. Word has length 48 [2025-03-04 10:38:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:04,466 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 312 transitions. [2025-03-04 10:38:04,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 312 transitions. [2025-03-04 10:38:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:38:04,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:04,467 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 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] [2025-03-04 10:38:04,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:38:04,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:04,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2134592211, now seen corresponding path program 1 times [2025-03-04 10:38:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:04,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582778408] [2025-03-04 10:38:04,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:04,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:38:04,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:38:04,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:04,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:38:04,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:04,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582778408] [2025-03-04 10:38:04,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582778408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:04,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:04,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386101305] [2025-03-04 10:38:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:04,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:04,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:04,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,529 INFO L87 Difference]: Start difference. First operand 222 states and 312 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:04,552 INFO L93 Difference]: Finished difference Result 457 states and 649 transitions. [2025-03-04 10:38:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-04 10:38:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:04,553 INFO L225 Difference]: With dead ends: 457 [2025-03-04 10:38:04,553 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 10:38:04,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,555 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 30 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:04,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 234 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 10:38:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-04 10:38:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 1.3983050847457628) internal successors, (330), 237 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 330 transitions. [2025-03-04 10:38:04,561 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 330 transitions. Word has length 56 [2025-03-04 10:38:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:04,561 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 330 transitions. [2025-03-04 10:38:04,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 330 transitions. [2025-03-04 10:38:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:38:04,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:04,562 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 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 10:38:04,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:38:04,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:04,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash -112873290, now seen corresponding path program 1 times [2025-03-04 10:38:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325386534] [2025-03-04 10:38:04,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:04,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:38:04,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:38:04,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:04,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:38:04,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325386534] [2025-03-04 10:38:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325386534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:04,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:04,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117413164] [2025-03-04 10:38:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:04,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:04,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:04,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,626 INFO L87 Difference]: Start difference. First operand 238 states and 330 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:04,645 INFO L93 Difference]: Finished difference Result 449 states and 621 transitions. [2025-03-04 10:38:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:04,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-04 10:38:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:04,647 INFO L225 Difference]: With dead ends: 449 [2025-03-04 10:38:04,647 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 10:38:04,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,648 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 55 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:04,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 171 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 10:38:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 10:38:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.349056603773585) internal successors, (286), 213 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 286 transitions. [2025-03-04 10:38:04,653 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 286 transitions. Word has length 64 [2025-03-04 10:38:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:04,653 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 286 transitions. [2025-03-04 10:38:04,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 286 transitions. [2025-03-04 10:38:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 10:38:04,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:04,653 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 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] [2025-03-04 10:38:04,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:38:04,654 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:04,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1707123250, now seen corresponding path program 1 times [2025-03-04 10:38:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978362577] [2025-03-04 10:38:04,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:04,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 10:38:04,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 10:38:04,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:04,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:38:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:04,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978362577] [2025-03-04 10:38:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978362577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146625870] [2025-03-04 10:38:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:04,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:04,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,734 INFO L87 Difference]: Start difference. First operand 214 states and 286 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:04,744 INFO L93 Difference]: Finished difference Result 332 states and 443 transitions. [2025-03-04 10:38:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:04,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-04 10:38:04,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:04,745 INFO L225 Difference]: With dead ends: 332 [2025-03-04 10:38:04,745 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 10:38:04,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:04,745 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:04,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 10:38:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 10:38:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 213 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 284 transitions. [2025-03-04 10:38:04,751 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 284 transitions. Word has length 74 [2025-03-04 10:38:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:04,751 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 284 transitions. [2025-03-04 10:38:04,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 284 transitions. [2025-03-04 10:38:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 10:38:04,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:04,752 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 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] [2025-03-04 10:38:04,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:38:04,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:04,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1482955569, now seen corresponding path program 1 times [2025-03-04 10:38:04,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:04,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053026543] [2025-03-04 10:38:04,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:04,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 10:38:04,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 10:38:04,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:04,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:38:04,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053026543] [2025-03-04 10:38:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053026543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823916180] [2025-03-04 10:38:04,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:04,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:04,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:04,919 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:04,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:38:04,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 10:38:04,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 10:38:05,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:05,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:05,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:38:05,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:38:05,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:38:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823916180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:05,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:05,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:38:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975338046] [2025-03-04 10:38:05,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:05,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:38:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:05,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:38:05,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:38:05,180 INFO L87 Difference]: Start difference. First operand 214 states and 284 transitions. Second operand has 9 states, 8 states have (on average 17.75) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:05,293 INFO L93 Difference]: Finished difference Result 592 states and 792 transitions. [2025-03-04 10:38:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:38:05,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 17.75) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-04 10:38:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:05,296 INFO L225 Difference]: With dead ends: 592 [2025-03-04 10:38:05,297 INFO L226 Difference]: Without dead ends: 590 [2025-03-04 10:38:05,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:38:05,298 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 733 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:05,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 696 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:38:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-04 10:38:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-04 10:38:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 588 states have (on average 1.3333333333333333) internal successors, (784), 589 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 784 transitions. [2025-03-04 10:38:05,315 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 784 transitions. Word has length 76 [2025-03-04 10:38:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:05,315 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 784 transitions. [2025-03-04 10:38:05,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 17.75) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 784 transitions. [2025-03-04 10:38:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 10:38:05,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:05,317 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 9, 9, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:05,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 10:38:05,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:38:05,518 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:05,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash -400704575, now seen corresponding path program 2 times [2025-03-04 10:38:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:05,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75301029] [2025-03-04 10:38:05,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:38:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:05,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-04 10:38:05,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 10:38:05,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:38:05,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 26 proven. 435 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:38:06,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75301029] [2025-03-04 10:38:06,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75301029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706174418] [2025-03-04 10:38:06,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:38:06,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:06,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:06,235 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:06,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:38:06,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-04 10:38:06,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 10:38:06,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:38:06,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:06,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:38:06,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 26 proven. 432 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:38:06,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 26 proven. 432 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:38:06,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706174418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:06,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:06,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2025-03-04 10:38:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379898037] [2025-03-04 10:38:06,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:38:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:38:06,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=219, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:38:06,832 INFO L87 Difference]: Start difference. First operand 590 states and 784 transitions. Second operand has 20 states, 19 states have (on average 19.42105263157895) internal successors, (369), 20 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:07,352 INFO L93 Difference]: Finished difference Result 2129 states and 2857 transitions. [2025-03-04 10:38:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 10:38:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 19.42105263157895) internal successors, (369), 20 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2025-03-04 10:38:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:07,361 INFO L225 Difference]: With dead ends: 2129 [2025-03-04 10:38:07,361 INFO L226 Difference]: Without dead ends: 2127 [2025-03-04 10:38:07,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=537, Invalid=1103, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:38:07,363 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 2602 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:07,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 1460 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:38:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-03-04 10:38:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 759. [2025-03-04 10:38:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 1.3298153034300793) internal successors, (1008), 758 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1008 transitions. [2025-03-04 10:38:07,383 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1008 transitions. Word has length 196 [2025-03-04 10:38:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:07,383 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1008 transitions. [2025-03-04 10:38:07,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 19.42105263157895) internal successors, (369), 20 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:07,383 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1008 transitions. [2025-03-04 10:38:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-04 10:38:07,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:07,388 INFO L218 NwaCegarLoop]: trace histogram [31, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:07,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:07,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:38:07,588 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:07,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1952714402, now seen corresponding path program 1 times [2025-03-04 10:38:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:07,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614631567] [2025-03-04 10:38:07,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:07,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-04 10:38:07,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-04 10:38:07,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:07,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2858 backedges. 1610 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2025-03-04 10:38:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:07,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614631567] [2025-03-04 10:38:07,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614631567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:38:07,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:38:07,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:38:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949172774] [2025-03-04 10:38:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:07,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:38:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:07,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:38:07,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:07,776 INFO L87 Difference]: Start difference. First operand 759 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:07,803 INFO L93 Difference]: Finished difference Result 1468 states and 1949 transitions. [2025-03-04 10:38:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:38:07,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 450 [2025-03-04 10:38:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:07,806 INFO L225 Difference]: With dead ends: 1468 [2025-03-04 10:38:07,806 INFO L226 Difference]: Without dead ends: 717 [2025-03-04 10:38:07,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:38:07,807 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:07,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 197 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-04 10:38:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2025-03-04 10:38:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.3156424581005586) internal successors, (942), 716 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 942 transitions. [2025-03-04 10:38:07,819 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 942 transitions. Word has length 450 [2025-03-04 10:38:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 942 transitions. [2025-03-04 10:38:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 942 transitions. [2025-03-04 10:38:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-04 10:38:07,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:07,824 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 23, 23, 15, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:38:07,824 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1722654491, now seen corresponding path program 2 times [2025-03-04 10:38:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581993386] [2025-03-04 10:38:07,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:38:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:07,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 466 statements into 2 equivalence classes. [2025-03-04 10:38:07,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 466 of 466 statements. [2025-03-04 10:38:07,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:38:07,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 62 proven. 2953 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:38:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:09,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581993386] [2025-03-04 10:38:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581993386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:09,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369695849] [2025-03-04 10:38:09,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:38:09,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:09,329 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:09,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:38:09,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 466 statements into 2 equivalence classes. [2025-03-04 10:38:09,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 466 of 466 statements. [2025-03-04 10:38:09,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:38:09,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:09,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:38:09,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 62 proven. 2953 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:38:10,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 62 proven. 2953 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 10:38:10,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369695849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:10,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:10,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 10:38:10,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743240192] [2025-03-04 10:38:10,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:10,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 10:38:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:10,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 10:38:10,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:38:10,774 INFO L87 Difference]: Start difference. First operand 717 states and 942 transitions. Second operand has 35 states, 34 states have (on average 24.764705882352942) internal successors, (842), 35 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:11,284 INFO L93 Difference]: Finished difference Result 1546 states and 2040 transitions. [2025-03-04 10:38:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 10:38:11,285 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 24.764705882352942) internal successors, (842), 35 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 466 [2025-03-04 10:38:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:11,291 INFO L225 Difference]: With dead ends: 1546 [2025-03-04 10:38:11,292 INFO L226 Difference]: Without dead ends: 1545 [2025-03-04 10:38:11,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 928 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:38:11,293 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 3359 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3359 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:11,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3359 Valid, 2640 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:38:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-03-04 10:38:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2025-03-04 10:38:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.3154145077720207) internal successors, (2031), 1544 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2031 transitions. [2025-03-04 10:38:11,319 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2031 transitions. Word has length 466 [2025-03-04 10:38:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:11,319 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2031 transitions. [2025-03-04 10:38:11,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 24.764705882352942) internal successors, (842), 35 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2031 transitions. [2025-03-04 10:38:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2025-03-04 10:38:11,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:11,336 INFO L218 NwaCegarLoop]: trace histogram [68, 67, 50, 50, 33, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:11,345 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 10:38:11,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:11,541 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:11,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:11,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1384389338, now seen corresponding path program 3 times [2025-03-04 10:38:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:11,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075190373] [2025-03-04 10:38:11,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:38:11,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:11,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1006 statements into 28 equivalence classes. [2025-03-04 10:38:13,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 1006 of 1006 statements. [2025-03-04 10:38:13,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-03-04 10:38:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14929 backedges. 134 proven. 14662 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 10:38:18,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075190373] [2025-03-04 10:38:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075190373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189150367] [2025-03-04 10:38:18,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:38:18,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:18,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:18,796 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:18,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:38:18,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1006 statements into 28 equivalence classes. [2025-03-04 10:38:19,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 1006 of 1006 statements. [2025-03-04 10:38:19,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-03-04 10:38:19,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:19,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 3554 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-04 10:38:19,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14929 backedges. 134 proven. 14662 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 10:38:20,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14929 backedges. 134 proven. 14662 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 10:38:22,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189150367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:22,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:22,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2025-03-04 10:38:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396898103] [2025-03-04 10:38:22,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:22,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-04 10:38:22,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:22,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-04 10:38:22,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 10:38:22,107 INFO L87 Difference]: Start difference. First operand 1545 states and 2031 transitions. Second operand has 71 states, 70 states have (on average 25.914285714285715) internal successors, (1814), 71 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:24,173 INFO L93 Difference]: Finished difference Result 3202 states and 4227 transitions. [2025-03-04 10:38:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 10:38:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 25.914285714285715) internal successors, (1814), 71 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1006 [2025-03-04 10:38:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:24,182 INFO L225 Difference]: With dead ends: 3202 [2025-03-04 10:38:24,182 INFO L226 Difference]: Without dead ends: 3201 [2025-03-04 10:38:24,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2078 GetRequests, 2008 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 10:38:24,184 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 7018 mSDsluCounter, 5431 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7018 SdHoareTripleChecker+Valid, 5537 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:24,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7018 Valid, 5537 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:38:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-03-04 10:38:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2025-03-04 10:38:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 1.3153125) internal successors, (4209), 3200 states have internal predecessors, (4209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4209 transitions. [2025-03-04 10:38:24,221 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4209 transitions. Word has length 1006 [2025-03-04 10:38:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:24,222 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4209 transitions. [2025-03-04 10:38:24,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 25.914285714285715) internal successors, (1814), 71 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4209 transitions. [2025-03-04 10:38:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2087 [2025-03-04 10:38:24,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:24,301 INFO L218 NwaCegarLoop]: trace histogram [140, 139, 104, 104, 69, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:24,313 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 10:38:24,505 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,SelfDestructingSolverStorable17 [2025-03-04 10:38:24,505 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:38:24,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 650607400, now seen corresponding path program 4 times [2025-03-04 10:38:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718132467] [2025-03-04 10:38:24,506 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:38:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:24,609 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2086 statements into 2 equivalence classes. [2025-03-04 10:38:25,627 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2086 of 2086 statements. [2025-03-04 10:38:25,627 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:38:25,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 65365 backedges. 278 proven. 64810 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-04 10:39:06,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718132467] [2025-03-04 10:39:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718132467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495261713] [2025-03-04 10:39:06,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:39:06,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:06,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:06,125 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:39:06,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:39:06,492 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2086 statements into 2 equivalence classes. [2025-03-04 10:39:07,117 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2086 of 2086 statements. [2025-03-04 10:39:07,117 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:39:07,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:07,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 7316 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-03-04 10:39:07,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 65365 backedges. 278 proven. 64810 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-04 10:39:08,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 65365 backedges. 278 proven. 64810 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-04 10:39:13,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495261713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:13,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:39:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2025-03-04 10:39:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979951480] [2025-03-04 10:39:13,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2025-03-04 10:39:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:13,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2025-03-04 10:39:13,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2025-03-04 10:39:13,736 INFO L87 Difference]: Start difference. First operand 3201 states and 4209 transitions. Second operand has 142 states, 141 states have (on average 26.588652482269502) internal successors, (3749), 142 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)