./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound10.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 ebfcdae9f2d92c4e39230ecf30ad4ac0897188e9aff6dcbde95509d87ea826ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:23:59,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:23:59,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:23:59,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:23:59,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:23:59,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:23:59,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:23:59,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:23:59,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:23:59,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:23:59,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:23:59,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:23:59,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:23:59,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:23:59,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:23:59,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:23:59,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:23:59,875 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:23:59,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:23:59,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:23:59,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:23:59,876 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 -> ebfcdae9f2d92c4e39230ecf30ad4ac0897188e9aff6dcbde95509d87ea826ad [2025-03-04 11:24:00,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:24:00,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:24:00,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:24:00,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:24:00,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:24:00,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound10.c [2025-03-04 11:24:01,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44a98b8c/ae2e65e168434016be51f577899ecfd5/FLAGc81e95a0c [2025-03-04 11:24:01,390 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:24:01,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound10.c [2025-03-04 11:24:01,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44a98b8c/ae2e65e168434016be51f577899ecfd5/FLAGc81e95a0c [2025-03-04 11:24:01,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44a98b8c/ae2e65e168434016be51f577899ecfd5 [2025-03-04 11:24:01,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:24:01,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:24:01,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:24:01,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:24:01,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:24:01,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d822e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01, skipping insertion in model container [2025-03-04 11:24:01,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:24:01,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:24:01,887 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:24:01,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:24:01,918 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:24:01,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01 WrapperNode [2025-03-04 11:24:01,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:24:01,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:24:01,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:24:01,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:24:01,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,944 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2025-03-04 11:24:01,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:24:01,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:24:01,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:24:01,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:24:01,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,959 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:24:01,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:24:01,968 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:24:01,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:24:01,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:24:01,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (1/1) ... [2025-03-04 11:24:01,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:24:01,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:01,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:24:01,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:24:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:24:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:24:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:24:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:24:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:24:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:24:02,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:24:02,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:24:02,556 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-04 11:24:02,556 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:24:02,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:24:02,569 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:24:02,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:24:02 BoogieIcfgContainer [2025-03-04 11:24:02,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:24:02,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:24:02,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:24:02,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:24:02,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:24:01" (1/3) ... [2025-03-04 11:24:02,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254c20da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:24:02, skipping insertion in model container [2025-03-04 11:24:02,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:24:01" (2/3) ... [2025-03-04 11:24:02,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254c20da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:24:02, skipping insertion in model container [2025-03-04 11:24:02,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:24:02" (3/3) ... [2025-03-04 11:24:02,576 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound10.c [2025-03-04 11:24:02,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:24:02,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_unwindbound10.c that has 2 procedures, 228 locations, 1 initial locations, 1 loop locations, and 104 error locations. [2025-03-04 11:24:02,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:24:02,648 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;@7ecb74b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:24:02,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-03-04 11:24:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:24:02,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:02,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:24:02,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:02,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1076753698, now seen corresponding path program 1 times [2025-03-04 11:24:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512951123] [2025-03-04 11:24:02,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:02,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:24:02,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:24:02,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:02,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:02,749 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 11:24:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512951123] [2025-03-04 11:24:02,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512951123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:02,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:02,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:24:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447366166] [2025-03-04 11:24:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:02,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:24:02,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:24:02,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:24:02,766 INFO L87 Difference]: Start difference. First operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:02,784 INFO L93 Difference]: Finished difference Result 427 states and 466 transitions. [2025-03-04 11:24:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:24:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:24:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:02,789 INFO L225 Difference]: With dead ends: 427 [2025-03-04 11:24:02,789 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 11:24:02,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:24:02,793 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:02,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 11:24:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-04 11:24:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.7017543859649122) internal successors, (194), 192 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2025-03-04 11:24:02,821 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 6 [2025-03-04 11:24:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:02,821 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2025-03-04 11:24:02,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2025-03-04 11:24:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:24:02,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:02,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:24:02,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:24:02,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:02,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:02,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1076723907, now seen corresponding path program 1 times [2025-03-04 11:24:02,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:02,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253746493] [2025-03-04 11:24:02,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:02,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:24:02,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:24:02,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:02,899 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 11:24:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253746493] [2025-03-04 11:24:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253746493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:02,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:24:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002381683] [2025-03-04 11:24:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:02,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:02,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:02,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:02,902 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:02,956 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2025-03-04 11:24:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:02,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:24:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:02,958 INFO L225 Difference]: With dead ends: 287 [2025-03-04 11:24:02,958 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 11:24:02,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:02,959 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 4 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:02,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 575 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 11:24:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-04 11:24:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 118 states have (on average 1.6779661016949152) internal successors, (198), 196 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2025-03-04 11:24:02,970 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 6 [2025-03-04 11:24:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:02,970 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2025-03-04 11:24:02,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2025-03-04 11:24:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:24:02,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:02,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:24:02,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1865964263, now seen corresponding path program 1 times [2025-03-04 11:24:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775739399] [2025-03-04 11:24:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:02,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:24:02,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:24:02,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:02,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:03,022 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 11:24:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775739399] [2025-03-04 11:24:03,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775739399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:03,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:03,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:24:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453447931] [2025-03-04 11:24:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:03,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:24:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:03,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:24:03,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:24:03,023 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:03,372 INFO L93 Difference]: Finished difference Result 360 states and 368 transitions. [2025-03-04 11:24:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:24:03,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 11:24:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:03,374 INFO L225 Difference]: With dead ends: 360 [2025-03-04 11:24:03,374 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:24:03,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:24:03,375 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 98 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:03,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 143 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:24:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:24:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2025-03-04 11:24:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 207 states have (on average 1.434782608695652) internal successors, (297), 285 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 303 transitions. [2025-03-04 11:24:03,384 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 303 transitions. Word has length 9 [2025-03-04 11:24:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:03,384 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 303 transitions. [2025-03-04 11:24:03,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 303 transitions. [2025-03-04 11:24:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:24:03,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:03,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:03,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:24:03,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:03,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1960171277, now seen corresponding path program 1 times [2025-03-04 11:24:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023349123] [2025-03-04 11:24:03,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:03,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:24:03,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:24:03,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:03,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:03,494 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 11:24:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:03,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023349123] [2025-03-04 11:24:03,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023349123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:03,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:03,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:24:03,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089628] [2025-03-04 11:24:03,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:03,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:24:03,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:03,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:24:03,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:24:03,495 INFO L87 Difference]: Start difference. First operand 290 states and 303 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:03,552 INFO L93 Difference]: Finished difference Result 314 states and 321 transitions. [2025-03-04 11:24:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:24:03,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-04 11:24:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:03,553 INFO L225 Difference]: With dead ends: 314 [2025-03-04 11:24:03,553 INFO L226 Difference]: Without dead ends: 307 [2025-03-04 11:24:03,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:24:03,554 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 68 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:03,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-04 11:24:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 289. [2025-03-04 11:24:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 206 states have (on average 1.4077669902912622) internal successors, (290), 284 states have internal predecessors, (290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 296 transitions. [2025-03-04 11:24:03,574 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 296 transitions. Word has length 47 [2025-03-04 11:24:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:03,574 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 296 transitions. [2025-03-04 11:24:03,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 296 transitions. [2025-03-04 11:24:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:24:03,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:03,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:03,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:24:03,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:03,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1766049009, now seen corresponding path program 1 times [2025-03-04 11:24:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308564094] [2025-03-04 11:24:03,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:03,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:24:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:24:03,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:03,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:03,678 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 11:24:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308564094] [2025-03-04 11:24:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308564094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:03,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:03,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233884435] [2025-03-04 11:24:03,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:03,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:03,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:03,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:03,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:03,679 INFO L87 Difference]: Start difference. First operand 289 states and 296 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 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 11:24:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:03,848 INFO L93 Difference]: Finished difference Result 309 states and 314 transitions. [2025-03-04 11:24:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 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 49 [2025-03-04 11:24:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:03,849 INFO L225 Difference]: With dead ends: 309 [2025-03-04 11:24:03,849 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 11:24:03,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:03,850 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 154 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:03,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 286 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 11:24:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2025-03-04 11:24:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 165 states have (on average 1.496969696969697) internal successors, (247), 243 states have internal predecessors, (247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 253 transitions. [2025-03-04 11:24:03,857 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 253 transitions. Word has length 49 [2025-03-04 11:24:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:03,857 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 253 transitions. [2025-03-04 11:24:03,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 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 11:24:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 253 transitions. [2025-03-04 11:24:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:24:03,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:03,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:24:03,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 633279679, now seen corresponding path program 1 times [2025-03-04 11:24:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431680033] [2025-03-04 11:24:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:24:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:24:03,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:03,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:03,926 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 11:24:03,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431680033] [2025-03-04 11:24:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431680033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:03,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:03,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:24:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815451260] [2025-03-04 11:24:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:03,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:24:03,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:03,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:24:03,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:24:03,928 INFO L87 Difference]: Start difference. First operand 248 states and 253 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:03,941 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2025-03-04 11:24:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:24:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-04 11:24:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:03,943 INFO L225 Difference]: With dead ends: 250 [2025-03-04 11:24:03,943 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 11:24:03,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:24:03,944 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:03,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 11:24:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-04 11:24:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 165 states have (on average 1.4848484848484849) internal successors, (245), 243 states have internal predecessors, (245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 251 transitions. [2025-03-04 11:24:03,949 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 251 transitions. Word has length 57 [2025-03-04 11:24:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:03,950 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 251 transitions. [2025-03-04 11:24:03,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 251 transitions. [2025-03-04 11:24:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 11:24:03,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:03,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:03,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:24:03,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:03,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash 94841784, now seen corresponding path program 1 times [2025-03-04 11:24:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:03,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896800919] [2025-03-04 11:24:03,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:03,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 11:24:03,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 11:24:03,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:03,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:03,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827498191] [2025-03-04 11:24:03,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:03,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:03,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:03,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:03,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:24:04,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 11:24:04,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 11:24:04,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:04,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:04,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:24:04,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:04,118 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 11:24:04,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:04,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:04,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896800919] [2025-03-04 11:24:04,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:04,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827498191] [2025-03-04 11:24:04,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827498191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:04,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:04,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:04,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090774132] [2025-03-04 11:24:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:04,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:04,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:04,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:04,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:04,120 INFO L87 Difference]: Start difference. First operand 248 states and 251 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:04,487 INFO L93 Difference]: Finished difference Result 428 states and 442 transitions. [2025-03-04 11:24:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:04,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-04 11:24:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:04,488 INFO L225 Difference]: With dead ends: 428 [2025-03-04 11:24:04,488 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 11:24:04,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:04,490 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:04,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 165 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:24:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 11:24:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 355. [2025-03-04 11:24:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 270 states have (on average 1.3592592592592592) internal successors, (367), 348 states have internal predecessors, (367), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:24:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 377 transitions. [2025-03-04 11:24:04,498 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 377 transitions. Word has length 62 [2025-03-04 11:24:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:04,498 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 377 transitions. [2025-03-04 11:24:04,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 377 transitions. [2025-03-04 11:24:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 11:24:04,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:04,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:04,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:24:04,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:04,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:04,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1692570227, now seen corresponding path program 1 times [2025-03-04 11:24:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:04,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938275409] [2025-03-04 11:24:04,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:04,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:24:04,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:24:04,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:04,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:04,759 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 11:24:04,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938275409] [2025-03-04 11:24:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938275409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:04,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:04,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495877935] [2025-03-04 11:24:04,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:04,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:04,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:04,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:04,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:04,760 INFO L87 Difference]: Start difference. First operand 355 states and 377 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:04,998 INFO L93 Difference]: Finished difference Result 356 states and 377 transitions. [2025-03-04 11:24:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:24:04,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-03-04 11:24:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:05,000 INFO L225 Difference]: With dead ends: 356 [2025-03-04 11:24:05,000 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 11:24:05,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:05,001 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 57 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:05,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 341 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 11:24:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 11:24:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 270 states have (on average 1.3555555555555556) internal successors, (366), 348 states have internal predecessors, (366), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:24:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 376 transitions. [2025-03-04 11:24:05,007 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 376 transitions. Word has length 69 [2025-03-04 11:24:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:05,007 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 376 transitions. [2025-03-04 11:24:05,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 376 transitions. [2025-03-04 11:24:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 11:24:05,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:05,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:05,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:24:05,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:05,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash 930069552, now seen corresponding path program 1 times [2025-03-04 11:24:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:05,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413172500] [2025-03-04 11:24:05,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:05,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:24:05,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:24:05,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:05,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:05,069 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 11:24:05,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413172500] [2025-03-04 11:24:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413172500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:05,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052142146] [2025-03-04 11:24:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:05,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:05,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:05,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:05,070 INFO L87 Difference]: Start difference. First operand 355 states and 376 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:05,287 INFO L93 Difference]: Finished difference Result 356 states and 376 transitions. [2025-03-04 11:24:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-03-04 11:24:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:05,289 INFO L225 Difference]: With dead ends: 356 [2025-03-04 11:24:05,289 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 11:24:05,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:05,289 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:05,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 350 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 11:24:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 11:24:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 270 states have (on average 1.3518518518518519) internal successors, (365), 348 states have internal predecessors, (365), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:24:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 375 transitions. [2025-03-04 11:24:05,296 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 375 transitions. Word has length 70 [2025-03-04 11:24:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:05,296 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 375 transitions. [2025-03-04 11:24:05,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 375 transitions. [2025-03-04 11:24:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:24:05,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:05,297 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:05,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:24:05,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:05,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 443647918, now seen corresponding path program 1 times [2025-03-04 11:24:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:05,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349489124] [2025-03-04 11:24:05,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:05,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:24:05,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:24:05,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:05,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:24:05,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349489124] [2025-03-04 11:24:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349489124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552651504] [2025-03-04 11:24:05,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:05,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:05,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:05,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:05,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:24:05,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:24:05,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:24:05,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:05,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:24:05,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:05,533 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 11:24:05,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552651504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:05,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:24:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913915609] [2025-03-04 11:24:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:05,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:05,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:05,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:05,534 INFO L87 Difference]: Start difference. First operand 355 states and 375 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:05,559 INFO L93 Difference]: Finished difference Result 355 states and 375 transitions. [2025-03-04 11:24:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:05,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2025-03-04 11:24:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:05,561 INFO L225 Difference]: With dead ends: 355 [2025-03-04 11:24:05,561 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 11:24:05,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:24:05,562 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 134 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:05,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 571 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 11:24:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 11:24:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.3444444444444446) internal successors, (363), 347 states have internal predecessors, (363), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:24:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 373 transitions. [2025-03-04 11:24:05,570 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 373 transitions. Word has length 72 [2025-03-04 11:24:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:05,570 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 373 transitions. [2025-03-04 11:24:05,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 373 transitions. [2025-03-04 11:24:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 11:24:05,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:05,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:05,580 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 11:24:05,771 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,SelfDestructingSolverStorable9 [2025-03-04 11:24:05,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:05,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 868183754, now seen corresponding path program 1 times [2025-03-04 11:24:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066124253] [2025-03-04 11:24:05,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:05,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 11:24:05,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 11:24:05,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:05,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:24:05,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066124253] [2025-03-04 11:24:05,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066124253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053503998] [2025-03-04 11:24:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:05,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:05,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:05,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:24:05,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 11:24:05,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 11:24:05,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:05,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:05,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:24:05,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:24:05,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053503998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:05,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:24:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691360204] [2025-03-04 11:24:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:05,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:05,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:05,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:05,997 INFO L87 Difference]: Start difference. First operand 354 states and 373 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:06,034 INFO L93 Difference]: Finished difference Result 484 states and 508 transitions. [2025-03-04 11:24:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-03-04 11:24:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:06,036 INFO L225 Difference]: With dead ends: 484 [2025-03-04 11:24:06,036 INFO L226 Difference]: Without dead ends: 483 [2025-03-04 11:24:06,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:24:06,037 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 132 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:06,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 893 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-04 11:24:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 443. [2025-03-04 11:24:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 435 states have internal predecessors, (483), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 497 transitions. [2025-03-04 11:24:06,048 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 497 transitions. Word has length 73 [2025-03-04 11:24:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:06,048 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 497 transitions. [2025-03-04 11:24:06,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 497 transitions. [2025-03-04 11:24:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 11:24:06,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:06,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:06,056 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 11:24:06,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:06,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:06,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash -591359070, now seen corresponding path program 1 times [2025-03-04 11:24:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:06,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668154610] [2025-03-04 11:24:06,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:06,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:06,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 11:24:06,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:24:06,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:06,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:06,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827668757] [2025-03-04 11:24:06,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:06,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:06,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:06,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:06,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:24:06,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 11:24:06,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:24:06,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:06,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:06,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:24:06,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:24:06,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:24:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668154610] [2025-03-04 11:24:06,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827668757] [2025-03-04 11:24:06,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827668757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:06,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:06,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:24:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958682819] [2025-03-04 11:24:06,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:06,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:24:06,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:06,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:24:06,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:06,781 INFO L87 Difference]: Start difference. First operand 443 states and 497 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:07,816 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions. [2025-03-04 11:24:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:24:07,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2025-03-04 11:24:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:07,819 INFO L225 Difference]: With dead ends: 467 [2025-03-04 11:24:07,819 INFO L226 Difference]: Without dead ends: 458 [2025-03-04 11:24:07,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:24:07,820 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 394 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:07,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 252 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:24:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-04 11:24:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 447. [2025-03-04 11:24:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 364 states have (on average 1.3186813186813187) internal successors, (480), 439 states have internal predecessors, (480), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 494 transitions. [2025-03-04 11:24:07,830 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 494 transitions. Word has length 113 [2025-03-04 11:24:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:07,830 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 494 transitions. [2025-03-04 11:24:07,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 494 transitions. [2025-03-04 11:24:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 11:24:07,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:07,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:07,837 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 11:24:08,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:08,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:08,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1360379936, now seen corresponding path program 1 times [2025-03-04 11:24:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:08,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948874465] [2025-03-04 11:24:08,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:08,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:08,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 11:24:08,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 11:24:08,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:08,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268165066] [2025-03-04 11:24:08,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:08,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:08,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:08,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:08,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:24:08,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 11:24:08,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 11:24:08,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:08,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:08,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:24:08,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:24:08,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:24:08,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948874465] [2025-03-04 11:24:08,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268165066] [2025-03-04 11:24:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268165066] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 11:24:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443505227] [2025-03-04 11:24:08,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:08,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:08,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:08,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:08,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:08,680 INFO L87 Difference]: Start difference. First operand 447 states and 494 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:12,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:21,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:25,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:27,370 INFO L93 Difference]: Finished difference Result 447 states and 494 transitions. [2025-03-04 11:24:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:27,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-03-04 11:24:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:27,372 INFO L225 Difference]: With dead ends: 447 [2025-03-04 11:24:27,372 INFO L226 Difference]: Without dead ends: 445 [2025-03-04 11:24:27,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:27,373 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 99 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:27,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 47 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 3 Unknown, 0 Unchecked, 18.7s Time] [2025-03-04 11:24:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-04 11:24:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-03-04 11:24:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 437 states have internal predecessors, (474), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 488 transitions. [2025-03-04 11:24:27,388 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 488 transitions. Word has length 115 [2025-03-04 11:24:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:27,388 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 488 transitions. [2025-03-04 11:24:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:24:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 488 transitions. [2025-03-04 11:24:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 11:24:27,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:27,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:27,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:27,600 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,SelfDestructingSolverStorable12 [2025-03-04 11:24:27,600 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:27,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash 55137216, now seen corresponding path program 1 times [2025-03-04 11:24:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:27,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012638308] [2025-03-04 11:24:27,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:27,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 11:24:27,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 11:24:27,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:27,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012638308] [2025-03-04 11:24:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012638308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896024544] [2025-03-04 11:24:27,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:27,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:27,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:24:27,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 11:24:27,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 11:24:27,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:27,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:27,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:24:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:24:27,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896024544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:27,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:24:27,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-03-04 11:24:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409180425] [2025-03-04 11:24:27,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:27,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:24:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:27,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:24:27,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:24:27,915 INFO L87 Difference]: Start difference. First operand 445 states and 488 transitions. Second operand has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 13 states have internal predecessors, (198), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:24:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:28,067 INFO L93 Difference]: Finished difference Result 739 states and 776 transitions. [2025-03-04 11:24:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:24:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 13 states have internal predecessors, (198), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 122 [2025-03-04 11:24:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:28,069 INFO L225 Difference]: With dead ends: 739 [2025-03-04 11:24:28,069 INFO L226 Difference]: Without dead ends: 611 [2025-03-04 11:24:28,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:24:28,071 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 312 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:28,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1482 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-04 11:24:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 526. [2025-03-04 11:24:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 441 states have (on average 1.4104308390022675) internal successors, (622), 514 states have internal predecessors, (622), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 638 transitions. [2025-03-04 11:24:28,085 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 638 transitions. Word has length 122 [2025-03-04 11:24:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:28,085 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 638 transitions. [2025-03-04 11:24:28,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 13 states have internal predecessors, (198), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:24:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 638 transitions. [2025-03-04 11:24:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 11:24:28,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:28,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:28,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:28,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:28,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:28,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1848586414, now seen corresponding path program 1 times [2025-03-04 11:24:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:28,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312410234] [2025-03-04 11:24:28,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:28,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:24:28,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:24:28,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:28,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:28,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312410234] [2025-03-04 11:24:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312410234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:28,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063878967] [2025-03-04 11:24:28,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:28,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:28,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:28,349 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:28,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:24:28,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:24:28,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:24:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:28,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:24:28,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:28,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063878967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:28,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:24:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738420276] [2025-03-04 11:24:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:28,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:28,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:28,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:28,481 INFO L87 Difference]: Start difference. First operand 526 states and 638 transitions. Second operand has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:28,510 INFO L93 Difference]: Finished difference Result 562 states and 644 transitions. [2025-03-04 11:24:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2025-03-04 11:24:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:28,513 INFO L225 Difference]: With dead ends: 562 [2025-03-04 11:24:28,513 INFO L226 Difference]: Without dead ends: 561 [2025-03-04 11:24:28,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:28,515 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 233 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:28,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 438 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-04 11:24:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 525. [2025-03-04 11:24:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 441 states have (on average 1.4036281179138321) internal successors, (619), 513 states have internal predecessors, (619), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 635 transitions. [2025-03-04 11:24:28,528 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 635 transitions. Word has length 123 [2025-03-04 11:24:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:28,528 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 635 transitions. [2025-03-04 11:24:28,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 635 transitions. [2025-03-04 11:24:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 11:24:28,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:28,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:28,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:28,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:28,731 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:28,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1471604077, now seen corresponding path program 1 times [2025-03-04 11:24:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234846477] [2025-03-04 11:24:28,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:28,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:28,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:24:28,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:24:28,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:28,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234846477] [2025-03-04 11:24:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234846477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331039728] [2025-03-04 11:24:28,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:28,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:28,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:28,793 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:28,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:24:28,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:24:28,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:24:28,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:28,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:28,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:24:28,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:28,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:29,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331039728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:29,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:24:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:24:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035121547] [2025-03-04 11:24:29,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:29,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:24:29,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:29,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:24:29,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:29,043 INFO L87 Difference]: Start difference. First operand 525 states and 635 transitions. Second operand has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:24:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:29,076 INFO L93 Difference]: Finished difference Result 644 states and 713 transitions. [2025-03-04 11:24:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:29,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2025-03-04 11:24:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:29,078 INFO L225 Difference]: With dead ends: 644 [2025-03-04 11:24:29,078 INFO L226 Difference]: Without dead ends: 643 [2025-03-04 11:24:29,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:29,079 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 118 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:29,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 715 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-03-04 11:24:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 571. [2025-03-04 11:24:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 486 states have (on average 1.4238683127572016) internal successors, (692), 558 states have internal predecessors, (692), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 710 transitions. [2025-03-04 11:24:29,091 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 710 transitions. Word has length 124 [2025-03-04 11:24:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 710 transitions. [2025-03-04 11:24:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:24:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 710 transitions. [2025-03-04 11:24:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 11:24:29,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:29,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:29,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:24:29,293 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,SelfDestructingSolverStorable15 [2025-03-04 11:24:29,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:29,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 770059561, now seen corresponding path program 1 times [2025-03-04 11:24:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343727626] [2025-03-04 11:24:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:29,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 11:24:29,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 11:24:29,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:29,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562946647] [2025-03-04 11:24:29,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:29,308 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:29,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:24:29,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 11:24:29,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 11:24:29,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:29,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:29,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:24:29,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:29,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343727626] [2025-03-04 11:24:29,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562946647] [2025-03-04 11:24:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562946647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:29,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:24:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694789260] [2025-03-04 11:24:29,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:24:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:29,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:24:29,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:29,622 INFO L87 Difference]: Start difference. First operand 571 states and 710 transitions. Second operand has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 8 states have internal predecessors, (236), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:24:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:30,205 INFO L93 Difference]: Finished difference Result 620 states and 716 transitions. [2025-03-04 11:24:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:24:30,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 8 states have internal predecessors, (236), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 128 [2025-03-04 11:24:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:30,207 INFO L225 Difference]: With dead ends: 620 [2025-03-04 11:24:30,207 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 11:24:30,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:30,208 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 472 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:30,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 173 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:24:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 11:24:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 549. [2025-03-04 11:24:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 482 states have (on average 1.2323651452282158) internal successors, (594), 537 states have internal predecessors, (594), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 612 transitions. [2025-03-04 11:24:30,220 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 612 transitions. Word has length 128 [2025-03-04 11:24:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:30,220 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 612 transitions. [2025-03-04 11:24:30,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 8 states have internal predecessors, (236), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:24:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 612 transitions. [2025-03-04 11:24:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 11:24:30,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:30,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:30,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:30,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:24:30,425 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:30,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1733475489, now seen corresponding path program 1 times [2025-03-04 11:24:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580845683] [2025-03-04 11:24:30,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:30,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 11:24:30,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 11:24:30,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:30,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445267798] [2025-03-04 11:24:30,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:30,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:30,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:30,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:30,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:24:30,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 11:24:30,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 11:24:30,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:30,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:30,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:24:30,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:30,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:31,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:31,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580845683] [2025-03-04 11:24:31,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:31,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445267798] [2025-03-04 11:24:31,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445267798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:31,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:31,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2025-03-04 11:24:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090264638] [2025-03-04 11:24:31,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:31,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:24:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:31,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:24:31,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:24:31,296 INFO L87 Difference]: Start difference. First operand 549 states and 612 transitions. Second operand has 11 states, 10 states have (on average 25.2) internal successors, (252), 11 states have internal predecessors, (252), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:24:39,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:43,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:43,920 INFO L93 Difference]: Finished difference Result 555 states and 615 transitions. [2025-03-04 11:24:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:24:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 25.2) internal successors, (252), 11 states have internal predecessors, (252), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 136 [2025-03-04 11:24:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:43,922 INFO L225 Difference]: With dead ends: 555 [2025-03-04 11:24:43,923 INFO L226 Difference]: Without dead ends: 554 [2025-03-04 11:24:43,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:24:43,923 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 390 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:43,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 151 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1234 Invalid, 1 Unknown, 0 Unchecked, 12.5s Time] [2025-03-04 11:24:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-04 11:24:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 548. [2025-03-04 11:24:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 482 states have (on average 1.2261410788381744) internal successors, (591), 536 states have internal predecessors, (591), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 609 transitions. [2025-03-04 11:24:43,939 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 609 transitions. Word has length 136 [2025-03-04 11:24:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:43,940 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 609 transitions. [2025-03-04 11:24:43,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 25.2) internal successors, (252), 11 states have internal predecessors, (252), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:24:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 609 transitions. [2025-03-04 11:24:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 11:24:43,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:43,941 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:43,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:44,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:24:44,141 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:44,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1986741281, now seen corresponding path program 1 times [2025-03-04 11:24:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350091406] [2025-03-04 11:24:44,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:44,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 11:24:44,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:24:44,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:44,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354288349] [2025-03-04 11:24:44,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:44,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:44,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:44,159 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:44,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:24:44,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 11:24:44,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:24:44,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:44,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:24:44,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:24:44,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350091406] [2025-03-04 11:24:44,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354288349] [2025-03-04 11:24:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354288349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:44,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 11:24:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980697893] [2025-03-04 11:24:44,742 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:44,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:44,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:44,743 INFO L87 Difference]: Start difference. First operand 548 states and 609 transitions. Second operand has 5 states, 4 states have (on average 39.5) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:45,110 INFO L93 Difference]: Finished difference Result 551 states and 612 transitions. [2025-03-04 11:24:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 39.5) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 170 [2025-03-04 11:24:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:45,112 INFO L225 Difference]: With dead ends: 551 [2025-03-04 11:24:45,112 INFO L226 Difference]: Without dead ends: 538 [2025-03-04 11:24:45,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:45,113 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 69 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:45,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 76 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:24:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-04 11:24:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 535. [2025-03-04 11:24:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 482 states have (on average 1.1742738589211619) internal successors, (566), 523 states have internal predecessors, (566), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 584 transitions. [2025-03-04 11:24:45,127 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 584 transitions. Word has length 170 [2025-03-04 11:24:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:45,128 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 584 transitions. [2025-03-04 11:24:45,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 39.5) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 584 transitions. [2025-03-04 11:24:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 11:24:45,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:45,129 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:45,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:45,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:45,329 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1459437545, now seen corresponding path program 1 times [2025-03-04 11:24:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147496810] [2025-03-04 11:24:45,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:45,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 11:24:45,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 11:24:45,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:45,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:45,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10353939] [2025-03-04 11:24:45,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:45,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:45,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:45,346 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:45,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:24:45,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 11:24:45,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 11:24:45,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:45,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:45,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:24:45,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:24:45,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:46,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:46,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147496810] [2025-03-04 11:24:46,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:46,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10353939] [2025-03-04 11:24:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10353939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:46,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:24:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188153947] [2025-03-04 11:24:46,054 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:46,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:24:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:46,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:24:46,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:46,055 INFO L87 Difference]: Start difference. First operand 535 states and 584 transitions. Second operand has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:46,367 INFO L93 Difference]: Finished difference Result 538 states and 586 transitions. [2025-03-04 11:24:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:46,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 171 [2025-03-04 11:24:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:46,369 INFO L225 Difference]: With dead ends: 538 [2025-03-04 11:24:46,369 INFO L226 Difference]: Without dead ends: 492 [2025-03-04 11:24:46,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:46,369 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:46,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:24:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-04 11:24:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-03-04 11:24:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 440 states have (on average 1.1886363636363637) internal successors, (523), 480 states have internal predecessors, (523), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 539 transitions. [2025-03-04 11:24:46,382 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 539 transitions. Word has length 171 [2025-03-04 11:24:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:46,382 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 539 transitions. [2025-03-04 11:24:46,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 539 transitions. [2025-03-04 11:24:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 11:24:46,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:46,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:24:46,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:46,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:46,585 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:46,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 598391797, now seen corresponding path program 1 times [2025-03-04 11:24:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:46,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650275285] [2025-03-04 11:24:46,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:46,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 11:24:46,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 11:24:46,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:46,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500409055] [2025-03-04 11:24:46,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:46,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:46,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:46,601 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:46,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:24:46,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 11:24:46,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 11:24:46,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:46,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:46,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:24:46,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 150 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:24:47,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:55,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_231| Int)) (or (< (+ |c_ULTIMATE.start_main_~y~0#1| 1) |v_ULTIMATE.start_main_~y~0#1_231|) (< (* |v_ULTIMATE.start_main_~y~0#1_231| |v_ULTIMATE.start_main_~y~0#1_231| |v_ULTIMATE.start_main_~y~0#1_231| |v_ULTIMATE.start_main_~y~0#1_231| |v_ULTIMATE.start_main_~y~0#1_231|) (+ 768614336404564651 (div (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 5)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 6)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 2))) 12))))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2025-03-04 11:24:55,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:55,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650275285] [2025-03-04 11:24:55,224 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:55,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500409055] [2025-03-04 11:24:55,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500409055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:55,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:55,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:24:55,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553686413] [2025-03-04 11:24:55,225 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:55,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:24:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:55,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:24:55,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2025-03-04 11:24:55,225 INFO L87 Difference]: Start difference. First operand 492 states and 539 transitions. Second operand has 9 states, 8 states have (on average 22.0) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:55,760 INFO L93 Difference]: Finished difference Result 502 states and 541 transitions. [2025-03-04 11:24:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:24:55,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 22.0) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 180 [2025-03-04 11:24:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:55,762 INFO L225 Difference]: With dead ends: 502 [2025-03-04 11:24:55,762 INFO L226 Difference]: Without dead ends: 498 [2025-03-04 11:24:55,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=50, Invalid=135, Unknown=1, NotChecked=24, Total=210 [2025-03-04 11:24:55,762 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 82 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:55,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 464 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:24:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-04 11:24:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2025-03-04 11:24:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 440 states have (on average 1.1795454545454545) internal successors, (519), 480 states have internal predecessors, (519), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 535 transitions. [2025-03-04 11:24:55,778 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 535 transitions. Word has length 180 [2025-03-04 11:24:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:55,778 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 535 transitions. [2025-03-04 11:24:55,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 22.0) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:24:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 535 transitions. [2025-03-04 11:24:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 11:24:55,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:55,780 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:24:55,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:24:55,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 11:24:55,980 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1671534088, now seen corresponding path program 1 times [2025-03-04 11:24:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170970187] [2025-03-04 11:24:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:55,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 11:24:55,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 11:24:55,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:55,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501232017] [2025-03-04 11:24:55,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:55,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:56,000 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:56,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:24:56,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 11:24:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 11:24:56,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:56,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:56,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:24:56,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:24:56,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170970187] [2025-03-04 11:24:56,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501232017] [2025-03-04 11:24:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501232017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:56,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:24:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351385488] [2025-03-04 11:24:56,262 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:24:56,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:56,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:24:56,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:56,263 INFO L87 Difference]: Start difference. First operand 492 states and 535 transitions. Second operand has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:56,640 INFO L93 Difference]: Finished difference Result 555 states and 602 transitions. [2025-03-04 11:24:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:56,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 196 [2025-03-04 11:24:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:56,642 INFO L225 Difference]: With dead ends: 555 [2025-03-04 11:24:56,642 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 11:24:56,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:56,645 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 147 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:56,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 124 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:24:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 11:24:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 522. [2025-03-04 11:24:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 470 states have (on average 1.1680851063829787) internal successors, (549), 510 states have internal predecessors, (549), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 565 transitions. [2025-03-04 11:24:56,662 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 565 transitions. Word has length 196 [2025-03-04 11:24:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:56,663 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 565 transitions. [2025-03-04 11:24:56,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:24:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 565 transitions. [2025-03-04 11:24:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 11:24:56,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:56,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:24:56,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:24:56,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:56,865 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -26487402, now seen corresponding path program 1 times [2025-03-04 11:24:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268776423] [2025-03-04 11:24:56,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:56,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 11:24:56,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 11:24:56,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:56,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:56,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462688979] [2025-03-04 11:24:56,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:56,885 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:56,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:24:56,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 11:24:56,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 11:24:56,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:56,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:56,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:24:56,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:24:57,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:24:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268776423] [2025-03-04 11:24:57,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462688979] [2025-03-04 11:24:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462688979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:57,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:57,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 11:24:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910109218] [2025-03-04 11:24:57,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:24:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:57,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:24:57,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:57,414 INFO L87 Difference]: Start difference. First operand 522 states and 565 transitions. Second operand has 10 states, 9 states have (on average 40.666666666666664) internal successors, (366), 10 states have internal predecessors, (366), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:24:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:58,120 INFO L93 Difference]: Finished difference Result 565 states and 601 transitions. [2025-03-04 11:24:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:24:58,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 40.666666666666664) internal successors, (366), 10 states have internal predecessors, (366), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 198 [2025-03-04 11:24:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:58,122 INFO L225 Difference]: With dead ends: 565 [2025-03-04 11:24:58,122 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 11:24:58,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:24:58,122 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 588 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:58,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 263 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:24:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 11:24:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 515. [2025-03-04 11:24:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 477 states have (on average 1.0859538784067087) internal successors, (518), 503 states have internal predecessors, (518), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 534 transitions. [2025-03-04 11:24:58,135 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 534 transitions. Word has length 198 [2025-03-04 11:24:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:58,135 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 534 transitions. [2025-03-04 11:24:58,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 40.666666666666664) internal successors, (366), 10 states have internal predecessors, (366), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:24:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 534 transitions. [2025-03-04 11:24:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 11:24:58,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:58,137 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:58,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:58,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:58,338 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:58,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1921542680, now seen corresponding path program 2 times [2025-03-04 11:24:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:58,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601625585] [2025-03-04 11:24:58,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:58,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 237 statements into 2 equivalence classes. [2025-03-04 11:24:58,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 11:24:58,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:24:58,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:58,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323286552] [2025-03-04 11:24:58,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:58,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:58,363 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:58,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:24:58,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 237 statements into 2 equivalence classes. [2025-03-04 11:24:58,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 237 statements. [2025-03-04 11:24:58,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:24:58,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:58,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:24:58,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 11:24:58,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601625585] [2025-03-04 11:24:58,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323286552] [2025-03-04 11:24:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323286552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:58,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:58,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:24:58,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108417700] [2025-03-04 11:24:58,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:58,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:58,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:58,983 INFO L87 Difference]: Start difference. First operand 515 states and 534 transitions. Second operand has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:59,137 INFO L93 Difference]: Finished difference Result 518 states and 534 transitions. [2025-03-04 11:24:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:59,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 237 [2025-03-04 11:24:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:59,138 INFO L225 Difference]: With dead ends: 518 [2025-03-04 11:24:59,138 INFO L226 Difference]: Without dead ends: 457 [2025-03-04 11:24:59,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:59,139 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 51 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:59,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 89 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-04 11:24:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 426. [2025-03-04 11:24:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 399 states have (on average 1.055137844611529) internal successors, (421), 416 states have internal predecessors, (421), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:24:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 431 transitions. [2025-03-04 11:24:59,149 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 431 transitions. Word has length 237 [2025-03-04 11:24:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:59,149 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 431 transitions. [2025-03-04 11:24:59,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 431 transitions. [2025-03-04 11:24:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-04 11:24:59,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:59,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 11:24:59,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:24:59,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:24:59,350 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-03-04 11:24:59,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1165322586, now seen corresponding path program 2 times [2025-03-04 11:24:59,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:59,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783163121] [2025-03-04 11:24:59,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:59,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:59,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 246 statements into 2 equivalence classes. [2025-03-04 11:24:59,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 246 of 246 statements. [2025-03-04 11:24:59,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:24:59,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:59,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573437564] [2025-03-04 11:24:59,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:59,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:59,388 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:59,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:24:59,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 246 statements into 2 equivalence classes. [2025-03-04 11:24:59,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 246 of 246 statements. [2025-03-04 11:24:59,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:24:59,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:59,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:24:59,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 6 proven. 318 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:24:59,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:25:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 6 proven. 318 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:25:02,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:25:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783163121] [2025-03-04 11:25:02,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:25:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573437564] [2025-03-04 11:25:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573437564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:25:02,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:25:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2025-03-04 11:25:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692143837] [2025-03-04 11:25:02,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:25:02,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:25:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:25:02,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:25:02,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:25:02,852 INFO L87 Difference]: Start difference. First operand 426 states and 431 transitions. Second operand has 20 states, 19 states have (on average 24.57894736842105) internal successors, (467), 20 states have internal predecessors, (467), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:25:07,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:11,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:16,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:21,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:26,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:28,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:33,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:25:38,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []