./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.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/cohencu-ll_valuebound5.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 ad40c7e9e7b0c80b1cec1e361a82d834fdd8270143479aa0f4bf8bc2b59c2aa5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:53:25,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:53:25,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:53:25,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:53:25,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:53:25,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:53:25,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:53:25,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:53:25,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:53:25,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:53:25,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:53:25,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:53:25,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:53:25,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:53:25,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:53:25,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:53:25,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:53:25,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:53:25,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:53:25,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:53:25,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:53:25,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:53:25,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:53:25,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:53:25,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:53:25,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:53:25,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:53:25,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:53:25,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:53:25,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:53:25,851 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 -> ad40c7e9e7b0c80b1cec1e361a82d834fdd8270143479aa0f4bf8bc2b59c2aa5 [2025-03-04 10:53:26,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:53:26,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:53:26,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:53:26,071 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:53:26,071 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:53:26,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c [2025-03-04 10:53:27,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eeb80a9b/cce7d6e61e2644b7af2f79e50ccb5c15/FLAGc719d13dd [2025-03-04 10:53:27,387 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:53:27,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c [2025-03-04 10:53:27,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eeb80a9b/cce7d6e61e2644b7af2f79e50ccb5c15/FLAGc719d13dd [2025-03-04 10:53:27,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eeb80a9b/cce7d6e61e2644b7af2f79e50ccb5c15 [2025-03-04 10:53:27,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:53:27,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:53:27,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:27,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:53:27,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:53:27,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322b4289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27, skipping insertion in model container [2025-03-04 10:53:27,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:53:27,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:27,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:53:27,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:27,947 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:53:27,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27 WrapperNode [2025-03-04 10:53:27,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:27,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:27,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:53:27,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:53:27,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,979 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 189 [2025-03-04 10:53:27,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:27,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:53:27,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:53:27,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:53:27,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,995 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:53:27,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:27,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:28,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:28,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:28,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:53:28,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:53:28,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:53:28,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:53:28,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (1/1) ... [2025-03-04 10:53:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:53:28,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:28,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:53:28,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:53:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:53:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:53:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:53:28,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:53:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:53:28,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:53:28,100 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:53:28,102 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:53:28,621 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-03-04 10:53:28,622 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:53:28,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:53:28,636 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:53:28,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:28 BoogieIcfgContainer [2025-03-04 10:53:28,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:53:28,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:53:28,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:53:28,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:53:28,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:53:27" (1/3) ... [2025-03-04 10:53:28,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:28, skipping insertion in model container [2025-03-04 10:53:28,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:27" (2/3) ... [2025-03-04 10:53:28,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:28, skipping insertion in model container [2025-03-04 10:53:28,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:28" (3/3) ... [2025-03-04 10:53:28,642 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound5.c [2025-03-04 10:53:28,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:53:28,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_valuebound5.c that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 138 error locations. [2025-03-04 10:53:28,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:53:28,703 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;@31a9f491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:53:28,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-03-04 10:53:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 151 states have (on average 1.9403973509933774) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:53:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:53:28,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:28,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:53:28,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:28,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash 312024932, now seen corresponding path program 1 times [2025-03-04 10:53:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-03-04 10:53:28,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:28,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:53:28,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:53:28,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:28,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:28,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:28,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-03-04 10:53:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438087861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:28,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:28,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105660501] [2025-03-04 10:53:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:28,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:53:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:28,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:53:28,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:53:28,833 INFO L87 Difference]: Start difference. First operand has 302 states, 151 states have (on average 1.9403973509933774) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:28,862 INFO L93 Difference]: Finished difference Result 593 states and 636 transitions. [2025-03-04 10:53:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:53:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-04 10:53:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:28,868 INFO L225 Difference]: With dead ends: 593 [2025-03-04 10:53:28,869 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 10:53:28,871 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 10:53:28,873 INFO L435 NwaCegarLoop]: 304 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, 304 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 10:53:28,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 10:53:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-04 10:53:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 146 states have (on average 1.8972602739726028) internal successors, (277), 276 states have internal predecessors, (277), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:53:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 297 transitions. [2025-03-04 10:53:28,906 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 297 transitions. Word has length 5 [2025-03-04 10:53:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:28,906 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 297 transitions. [2025-03-04 10:53:28,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 297 transitions. [2025-03-04 10:53:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:53:28,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:28,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:53:28,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:53:28,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:28,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash 312025893, now seen corresponding path program 1 times [2025-03-04 10:53:28,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:28,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-03-04 10:53:28,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:28,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:28,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:53:28,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:53:28,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:28,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-03-04 10:53:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057709066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:28,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:28,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640906841] [2025-03-04 10:53:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:28,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:28,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:28,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:28,970 INFO L87 Difference]: Start difference. First operand 288 states and 297 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:29,106 INFO L93 Difference]: Finished difference Result 556 states and 575 transitions. [2025-03-04 10:53:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:29,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 10:53:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:29,108 INFO L225 Difference]: With dead ends: 556 [2025-03-04 10:53:29,109 INFO L226 Difference]: Without dead ends: 536 [2025-03-04 10:53:29,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:29,109 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 237 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:29,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 520 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-04 10:53:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 346. [2025-03-04 10:53:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 199 states have (on average 1.7989949748743719) internal successors, (358), 329 states have internal predecessors, (358), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:53:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2025-03-04 10:53:29,142 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 5 [2025-03-04 10:53:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:29,143 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2025-03-04 10:53:29,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2025-03-04 10:53:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:53:29,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:29,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:29,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:53:29,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:29,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash -857936794, now seen corresponding path program 1 times [2025-03-04 10:53:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:29,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932324112] [2025-03-04 10:53:29,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:29,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:53:29,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:53:29,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:29,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:29,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058799137] [2025-03-04 10:53:29,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:29,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:29,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:29,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:53:29,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:53:29,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:53:29,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:29,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:29,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:29,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:29,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:29,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932324112] [2025-03-04 10:53:29,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058799137] [2025-03-04 10:53:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058799137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:29,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:29,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:29,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329802412] [2025-03-04 10:53:29,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:29,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:29,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:29,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:29,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:29,345 INFO L87 Difference]: Start difference. First operand 346 states and 388 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:29,716 INFO L93 Difference]: Finished difference Result 506 states and 563 transitions. [2025-03-04 10:53:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:29,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-04 10:53:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:29,718 INFO L225 Difference]: With dead ends: 506 [2025-03-04 10:53:29,719 INFO L226 Difference]: Without dead ends: 451 [2025-03-04 10:53:29,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:29,720 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 134 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:29,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 267 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-04 10:53:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 431. [2025-03-04 10:53:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.6523297491039426) internal successors, (461), 409 states have internal predecessors, (461), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 501 transitions. [2025-03-04 10:53:29,742 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 501 transitions. Word has length 38 [2025-03-04 10:53:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:29,743 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 501 transitions. [2025-03-04 10:53:29,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 501 transitions. [2025-03-04 10:53:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:53:29,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:29,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:29,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:29,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:29,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:29,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash 156468804, now seen corresponding path program 1 times [2025-03-04 10:53:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824674077] [2025-03-04 10:53:29,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:29,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:53:29,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:53:29,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:29,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:30,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:30,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824674077] [2025-03-04 10:53:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824674077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:30,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:30,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:30,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59341013] [2025-03-04 10:53:30,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:30,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:30,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:30,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:30,047 INFO L87 Difference]: Start difference. First operand 431 states and 501 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:30,273 INFO L93 Difference]: Finished difference Result 464 states and 508 transitions. [2025-03-04 10:53:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:30,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-04 10:53:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:30,275 INFO L225 Difference]: With dead ends: 464 [2025-03-04 10:53:30,275 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:30,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:30,276 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 120 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:30,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 425 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5698924731182795) internal successors, (438), 409 states have internal predecessors, (438), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 478 transitions. [2025-03-04 10:53:30,288 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 478 transitions. Word has length 40 [2025-03-04 10:53:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:30,288 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 478 transitions. [2025-03-04 10:53:30,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 478 transitions. [2025-03-04 10:53:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:53:30,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:30,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:30,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:53:30,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:30,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:30,290 INFO L85 PathProgramCache]: Analyzing trace with hash 42672162, now seen corresponding path program 1 times [2025-03-04 10:53:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534609508] [2025-03-04 10:53:30,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:53:30,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:53:30,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:30,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534609508] [2025-03-04 10:53:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534609508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359105176] [2025-03-04 10:53:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:30,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:30,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:30,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:30,369 INFO L87 Difference]: Start difference. First operand 431 states and 478 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:30,632 INFO L93 Difference]: Finished difference Result 443 states and 485 transitions. [2025-03-04 10:53:30,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 10:53:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:30,634 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:30,634 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:30,634 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 10:53:30,635 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 252 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:30,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 367 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5627240143369177) internal successors, (436), 409 states have internal predecessors, (436), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 476 transitions. [2025-03-04 10:53:30,644 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 476 transitions. Word has length 42 [2025-03-04 10:53:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:30,644 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 476 transitions. [2025-03-04 10:53:30,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 476 transitions. [2025-03-04 10:53:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:53:30,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:30,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:30,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:53:30,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:30,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1322837233, now seen corresponding path program 1 times [2025-03-04 10:53:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482736402] [2025-03-04 10:53:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:30,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:53:30,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:53:30,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:30,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482736402] [2025-03-04 10:53:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482736402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:30,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:30,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953977750] [2025-03-04 10:53:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:30,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:30,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:30,755 INFO L87 Difference]: Start difference. First operand 431 states and 476 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:31,749 INFO L93 Difference]: Finished difference Result 443 states and 483 transitions. [2025-03-04 10:53:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:31,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-04 10:53:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:31,751 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:31,751 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:31,751 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 10:53:31,752 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 136 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:31,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 448 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:53:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5555555555555556) internal successors, (434), 409 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 474 transitions. [2025-03-04 10:53:31,761 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 474 transitions. Word has length 43 [2025-03-04 10:53:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:31,761 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 474 transitions. [2025-03-04 10:53:31,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 474 transitions. [2025-03-04 10:53:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:53:31,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:31,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:31,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:53:31,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:31,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1975692322, now seen corresponding path program 1 times [2025-03-04 10:53:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:31,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328303696] [2025-03-04 10:53:31,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:31,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:53:31,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:53:31,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:31,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384956317] [2025-03-04 10:53:31,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:31,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:31,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:31,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:31,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:53:31,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:53:31,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:53:31,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:31,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:31,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:53:31,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:31,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:31,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328303696] [2025-03-04 10:53:31,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384956317] [2025-03-04 10:53:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384956317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:31,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:31,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525653412] [2025-03-04 10:53:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:31,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:31,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:31,980 INFO L87 Difference]: Start difference. First operand 431 states and 474 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:32,279 INFO L93 Difference]: Finished difference Result 448 states and 481 transitions. [2025-03-04 10:53:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-04 10:53:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:32,281 INFO L225 Difference]: With dead ends: 448 [2025-03-04 10:53:32,281 INFO L226 Difference]: Without dead ends: 439 [2025-03-04 10:53:32,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:32,282 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 112 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:32,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 257 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-04 10:53:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2025-03-04 10:53:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 412 states have internal predecessors, (431), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 471 transitions. [2025-03-04 10:53:32,295 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 471 transitions. Word has length 46 [2025-03-04 10:53:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:32,295 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 471 transitions. [2025-03-04 10:53:32,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 471 transitions. [2025-03-04 10:53:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:53:32,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:32,296 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:32,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:53:32,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1116919635, now seen corresponding path program 1 times [2025-03-04 10:53:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-04 10:53:32,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:32,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:53:32,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:53:32,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:32,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:32,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-04 10:53:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694015144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:32,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643998677] [2025-03-04 10:53:32,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:32,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:32,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:32,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:32,592 INFO L87 Difference]: Start difference. First operand 434 states and 471 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:32,990 INFO L93 Difference]: Finished difference Result 447 states and 472 transitions. [2025-03-04 10:53:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 10:53:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:32,992 INFO L225 Difference]: With dead ends: 447 [2025-03-04 10:53:32,992 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:32,993 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 10:53:32,993 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 132 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:32,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 384 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 434. [2025-03-04 10:53:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 412 states have internal predecessors, (425), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 465 transitions. [2025-03-04 10:53:33,005 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 465 transitions. Word has length 47 [2025-03-04 10:53:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:33,006 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 465 transitions. [2025-03-04 10:53:33,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 465 transitions. [2025-03-04 10:53:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:53:33,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:33,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:33,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:53:33,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:33,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2088594537, now seen corresponding path program 1 times [2025-03-04 10:53:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216791434] [2025-03-04 10:53:33,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:33,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:53:33,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:53:33,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:33,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216791434] [2025-03-04 10:53:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216791434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104022793] [2025-03-04 10:53:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:33,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:33,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:33,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:33,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:33,100 INFO L87 Difference]: Start difference. First operand 434 states and 465 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:33,434 INFO L93 Difference]: Finished difference Result 445 states and 466 transitions. [2025-03-04 10:53:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:33,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-04 10:53:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:33,436 INFO L225 Difference]: With dead ends: 445 [2025-03-04 10:53:33,436 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 10:53:33,436 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 10:53:33,436 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 226 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:33,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 269 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 10:53:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2025-03-04 10:53:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 219 states have (on average 1.6255707762557077) internal successors, (356), 349 states have internal predecessors, (356), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 390 transitions. [2025-03-04 10:53:33,447 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 390 transitions. Word has length 51 [2025-03-04 10:53:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:33,447 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 390 transitions. [2025-03-04 10:53:33,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 390 transitions. [2025-03-04 10:53:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 10:53:33,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:33,449 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:53:33,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1053201178, now seen corresponding path program 1 times [2025-03-04 10:53:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-04 10:53:33,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:33,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 10:53:33,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 10:53:33,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:33,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-04 10:53:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107710774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146524335] [2025-03-04 10:53:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:33,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:33,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:33,514 INFO L87 Difference]: Start difference. First operand 368 states and 390 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:33,772 INFO L93 Difference]: Finished difference Result 368 states and 390 transitions. [2025-03-04 10:53:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2025-03-04 10:53:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:33,774 INFO L225 Difference]: With dead ends: 368 [2025-03-04 10:53:33,774 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 10:53:33,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:33,775 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 138 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:33,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 155 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 10:53:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-04 10:53:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 219 states have (on average 1.5936073059360731) internal successors, (349), 342 states have internal predecessors, (349), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 383 transitions. [2025-03-04 10:53:33,783 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 383 transitions. Word has length 83 [2025-03-04 10:53:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:33,783 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 383 transitions. [2025-03-04 10:53:33,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 383 transitions. [2025-03-04 10:53:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 10:53:33,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:33,787 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:33,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:53:33,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:33,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1710501997, now seen corresponding path program 1 times [2025-03-04 10:53:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:33,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-04 10:53:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:33,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 10:53:33,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 10:53:33,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:33,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:33,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-04 10:53:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429963816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924510177] [2025-03-04 10:53:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:33,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:33,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:33,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:33,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:33,873 INFO L87 Difference]: Start difference. First operand 361 states and 383 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:34,050 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2025-03-04 10:53:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 84 [2025-03-04 10:53:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:34,052 INFO L225 Difference]: With dead ends: 368 [2025-03-04 10:53:34,052 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 10:53:34,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:34,052 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 24 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:34,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 392 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 10:53:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2025-03-04 10:53:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 221 states have (on average 1.588235294117647) internal successors, (351), 344 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 385 transitions. [2025-03-04 10:53:34,061 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 385 transitions. Word has length 84 [2025-03-04 10:53:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:34,062 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 385 transitions. [2025-03-04 10:53:34,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 385 transitions. [2025-03-04 10:53:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:34,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:34,063 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:34,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:53:34,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:34,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1214160528, now seen corresponding path program 1 times [2025-03-04 10:53:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:34,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433291539] [2025-03-04 10:53:34,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:34,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:34,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433291539] [2025-03-04 10:53:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433291539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028781802] [2025-03-04 10:53:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:34,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:34,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:34,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:34,136 INFO L87 Difference]: Start difference. First operand 363 states and 385 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:34,197 INFO L93 Difference]: Finished difference Result 363 states and 385 transitions. [2025-03-04 10:53:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2025-03-04 10:53:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:34,199 INFO L225 Difference]: With dead ends: 363 [2025-03-04 10:53:34,199 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 10:53:34,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:34,199 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 192 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:34,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 262 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 10:53:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-04 10:53:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 221 states have (on average 1.5701357466063348) internal successors, (347), 342 states have internal predecessors, (347), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 381 transitions. [2025-03-04 10:53:34,207 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 381 transitions. Word has length 86 [2025-03-04 10:53:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:34,208 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 381 transitions. [2025-03-04 10:53:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 381 transitions. [2025-03-04 10:53:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:53:34,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:34,208 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:34,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:53:34,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:34,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1485954615, now seen corresponding path program 1 times [2025-03-04 10:53:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:34,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454443277] [2025-03-04 10:53:34,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:34,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:34,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:34,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454443277] [2025-03-04 10:53:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454443277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340098748] [2025-03-04 10:53:34,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:34,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:34,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:53:34,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:34,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:34,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:34,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:34,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:34,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340098748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:34,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:53:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420835339] [2025-03-04 10:53:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:34,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:34,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:34,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:34,397 INFO L87 Difference]: Start difference. First operand 361 states and 381 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:34,485 INFO L93 Difference]: Finished difference Result 365 states and 381 transitions. [2025-03-04 10:53:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:34,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-04 10:53:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:34,487 INFO L225 Difference]: With dead ends: 365 [2025-03-04 10:53:34,487 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 10:53:34,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:34,488 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 258 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:34,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 394 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 10:53:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2025-03-04 10:53:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 221 states have (on average 1.5339366515837105) internal successors, (339), 334 states have internal predecessors, (339), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 373 transitions. [2025-03-04 10:53:34,496 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 373 transitions. Word has length 85 [2025-03-04 10:53:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:34,496 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 373 transitions. [2025-03-04 10:53:34,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 373 transitions. [2025-03-04 10:53:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 10:53:34,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:34,497 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:34,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:34,701 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:34,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1015729430, now seen corresponding path program 1 times [2025-03-04 10:53:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-03-04 10:53:34,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:34,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:53:34,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:53:34,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-03-04 10:53:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205411651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:34,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411370697] [2025-03-04 10:53:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:34,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:34,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:34,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:34,799 INFO L87 Difference]: Start difference. First operand 353 states and 373 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:34,926 INFO L93 Difference]: Finished difference Result 357 states and 373 transitions. [2025-03-04 10:53:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:34,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 87 [2025-03-04 10:53:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:34,928 INFO L225 Difference]: With dead ends: 357 [2025-03-04 10:53:34,928 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 10:53:34,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:34,929 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 48 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:34,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 700 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 10:53:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-04 10:53:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 219 states have (on average 1.5296803652968036) internal successors, (335), 332 states have internal predecessors, (335), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 369 transitions. [2025-03-04 10:53:34,936 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 369 transitions. Word has length 87 [2025-03-04 10:53:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:34,936 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 369 transitions. [2025-03-04 10:53:34,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 369 transitions. [2025-03-04 10:53:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:34,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:34,937 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 10:53:34,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:53:34,937 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:34,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1180046933, now seen corresponding path program 1 times [2025-03-04 10:53:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413795514] [2025-03-04 10:53:34,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:34,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:34,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:34,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:34,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:34,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413795514] [2025-03-04 10:53:34,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413795514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888841006] [2025-03-04 10:53:34,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:34,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:34,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:53:35,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:35,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:35,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:35,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:35,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:35,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:35,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888841006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:35,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:53:35,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109995683] [2025-03-04 10:53:35,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:35,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:35,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:35,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:35,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:35,199 INFO L87 Difference]: Start difference. First operand 351 states and 369 transitions. Second operand has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:35,334 INFO L93 Difference]: Finished difference Result 610 states and 648 transitions. [2025-03-04 10:53:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:35,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 86 [2025-03-04 10:53:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:35,336 INFO L225 Difference]: With dead ends: 610 [2025-03-04 10:53:35,336 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 10:53:35,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:35,337 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 467 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:35,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 743 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 10:53:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 409. [2025-03-04 10:53:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 278 states have (on average 1.5215827338129497) internal successors, (423), 385 states have internal predecessors, (423), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 10:53:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 467 transitions. [2025-03-04 10:53:35,350 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 467 transitions. Word has length 86 [2025-03-04 10:53:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:35,351 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 467 transitions. [2025-03-04 10:53:35,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 467 transitions. [2025-03-04 10:53:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:53:35,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:35,352 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 10:53:35,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:35,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:53:35,556 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:35,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1503557041, now seen corresponding path program 1 times [2025-03-04 10:53:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480172216] [2025-03-04 10:53:35,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:35,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:53:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:53:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633836351] [2025-03-04 10:53:35,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:35,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:35,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:53:35,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:53:35,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:53:35,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:35,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:35,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:35,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:35,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:35,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:35,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480172216] [2025-03-04 10:53:35,830 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:35,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633836351] [2025-03-04 10:53:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633836351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:35,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:53:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280180915] [2025-03-04 10:53:35,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:35,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:35,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:35,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:35,831 INFO L87 Difference]: Start difference. First operand 409 states and 467 transitions. Second operand has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:35,983 INFO L93 Difference]: Finished difference Result 612 states and 644 transitions. [2025-03-04 10:53:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 97 [2025-03-04 10:53:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:35,985 INFO L225 Difference]: With dead ends: 612 [2025-03-04 10:53:35,985 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 10:53:35,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:35,986 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1094 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:35,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 784 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 10:53:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 414. [2025-03-04 10:53:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 286 states have (on average 1.479020979020979) internal successors, (423), 389 states have internal predecessors, (423), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:53:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 469 transitions. [2025-03-04 10:53:36,004 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 469 transitions. Word has length 97 [2025-03-04 10:53:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:36,004 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 469 transitions. [2025-03-04 10:53:36,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 469 transitions. [2025-03-04 10:53:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:53:36,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:36,005 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:36,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:36,206 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,SelfDestructingSolverStorable15 [2025-03-04 10:53:36,206 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:36,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1039189943, now seen corresponding path program 1 times [2025-03-04 10:53:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:36,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477711095] [2025-03-04 10:53:36,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:36,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:53:36,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:53:36,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:36,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:53:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477711095] [2025-03-04 10:53:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477711095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:53:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089400634] [2025-03-04 10:53:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:36,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:36,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:36,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:36,321 INFO L87 Difference]: Start difference. First operand 414 states and 469 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:36,454 INFO L93 Difference]: Finished difference Result 420 states and 472 transitions. [2025-03-04 10:53:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:36,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 103 [2025-03-04 10:53:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:36,455 INFO L225 Difference]: With dead ends: 420 [2025-03-04 10:53:36,455 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 10:53:36,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:36,456 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 456 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:36,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 400 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 10:53:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-04 10:53:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 268 states have (on average 1.5037313432835822) internal successors, (403), 371 states have internal predecessors, (403), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 10:53:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 445 transitions. [2025-03-04 10:53:36,465 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 445 transitions. Word has length 103 [2025-03-04 10:53:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:36,465 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 445 transitions. [2025-03-04 10:53:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 445 transitions. [2025-03-04 10:53:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 10:53:36,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:36,466 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 10:53:36,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:53:36,466 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1503437932, now seen corresponding path program 1 times [2025-03-04 10:53:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528502430] [2025-03-04 10:53:36,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:36,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:36,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:36,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:36,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762076163] [2025-03-04 10:53:36,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:36,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:36,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:36,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:53:36,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:36,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:36,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:36,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:36,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:36,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:36,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:36,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:36,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528502430] [2025-03-04 10:53:36,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:36,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762076163] [2025-03-04 10:53:36,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762076163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:36,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:36,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:36,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829370817] [2025-03-04 10:53:36,885 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:36,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:36,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:36,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:36,886 INFO L87 Difference]: Start difference. First operand 394 states and 445 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:37,414 INFO L93 Difference]: Finished difference Result 522 states and 610 transitions. [2025-03-04 10:53:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:37,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2025-03-04 10:53:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:37,416 INFO L225 Difference]: With dead ends: 522 [2025-03-04 10:53:37,416 INFO L226 Difference]: Without dead ends: 497 [2025-03-04 10:53:37,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:37,417 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 133 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:37,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 405 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-04 10:53:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 479. [2025-03-04 10:53:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 348 states have (on average 1.5114942528735633) internal successors, (526), 451 states have internal predecessors, (526), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 578 transitions. [2025-03-04 10:53:37,428 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 578 transitions. Word has length 118 [2025-03-04 10:53:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:37,428 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 578 transitions. [2025-03-04 10:53:37,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 578 transitions. [2025-03-04 10:53:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 10:53:37,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:37,429 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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] [2025-03-04 10:53:37,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:53:37,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:53:37,629 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:37,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash 638064583, now seen corresponding path program 1 times [2025-03-04 10:53:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:37,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312212391] [2025-03-04 10:53:37,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:37,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:53:37,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:53:37,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311957702] [2025-03-04 10:53:37,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:37,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:37,649 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:37,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:53:37,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:53:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:53:37,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:37,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:37,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:37,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:37,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312212391] [2025-03-04 10:53:42,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311957702] [2025-03-04 10:53:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311957702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:42,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:42,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867313969] [2025-03-04 10:53:42,252 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:42,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:42,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:42,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2025-03-04 10:53:42,254 INFO L87 Difference]: Start difference. First operand 479 states and 578 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:42,663 INFO L93 Difference]: Finished difference Result 514 states and 585 transitions. [2025-03-04 10:53:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:42,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 119 [2025-03-04 10:53:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:42,668 INFO L225 Difference]: With dead ends: 514 [2025-03-04 10:53:42,668 INFO L226 Difference]: Without dead ends: 497 [2025-03-04 10:53:42,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2025-03-04 10:53:42,669 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 131 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:42,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 377 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-04 10:53:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 479. [2025-03-04 10:53:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 348 states have (on average 1.4626436781609196) internal successors, (509), 451 states have internal predecessors, (509), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 561 transitions. [2025-03-04 10:53:42,679 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 561 transitions. Word has length 119 [2025-03-04 10:53:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:42,680 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 561 transitions. [2025-03-04 10:53:42,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 561 transitions. [2025-03-04 10:53:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 10:53:42,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:42,680 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 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] [2025-03-04 10:53:42,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:42,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:42,882 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:42,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1694834190, now seen corresponding path program 1 times [2025-03-04 10:53:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:42,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468458769] [2025-03-04 10:53:42,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:42,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:42,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:53:42,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:53:42,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:42,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468458769] [2025-03-04 10:53:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468458769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12775077] [2025-03-04 10:53:42,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:42,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:42,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:42,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:42,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:53:43,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:53:43,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:53:43,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:43,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:43,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:43,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:43,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:43,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12775077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:43,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:43,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412079488] [2025-03-04 10:53:43,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:43,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:43,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:43,312 INFO L87 Difference]: Start difference. First operand 479 states and 561 transitions. Second operand has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:43,752 INFO L93 Difference]: Finished difference Result 496 states and 568 transitions. [2025-03-04 10:53:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:43,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 120 [2025-03-04 10:53:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:43,754 INFO L225 Difference]: With dead ends: 496 [2025-03-04 10:53:43,754 INFO L226 Difference]: Without dead ends: 491 [2025-03-04 10:53:43,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:43,755 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 335 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:43,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 512 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-04 10:53:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 475. [2025-03-04 10:53:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 348 states have (on average 1.4367816091954022) internal successors, (500), 447 states have internal predecessors, (500), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 552 transitions. [2025-03-04 10:53:43,766 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 552 transitions. Word has length 120 [2025-03-04 10:53:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:43,766 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 552 transitions. [2025-03-04 10:53:43,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 552 transitions. [2025-03-04 10:53:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 10:53:43,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:43,767 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 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] [2025-03-04 10:53:43,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:53:43,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:43,968 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:43,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1000252123, now seen corresponding path program 1 times [2025-03-04 10:53:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:43,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954014105] [2025-03-04 10:53:43,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:43,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:53:43,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:53:43,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:43,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954014105] [2025-03-04 10:53:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954014105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115511579] [2025-03-04 10:53:44,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:44,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:44,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:44,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:53:44,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:53:44,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:53:44,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:44,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:44,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:44,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:44,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115511579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:44,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144126267] [2025-03-04 10:53:44,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:44,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:44,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:44,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:44,376 INFO L87 Difference]: Start difference. First operand 475 states and 552 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:44,770 INFO L93 Difference]: Finished difference Result 492 states and 559 transitions. [2025-03-04 10:53:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:44,770 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), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 121 [2025-03-04 10:53:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:44,772 INFO L225 Difference]: With dead ends: 492 [2025-03-04 10:53:44,772 INFO L226 Difference]: Without dead ends: 487 [2025-03-04 10:53:44,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:44,772 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 333 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:44,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 472 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-04 10:53:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 471. [2025-03-04 10:53:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 348 states have (on average 1.410919540229885) internal successors, (491), 443 states have internal predecessors, (491), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 543 transitions. [2025-03-04 10:53:44,781 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 543 transitions. Word has length 121 [2025-03-04 10:53:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:44,781 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 543 transitions. [2025-03-04 10:53:44,781 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), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 543 transitions. [2025-03-04 10:53:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 10:53:44,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:44,782 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 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] [2025-03-04 10:53:44,788 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 10:53:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:44,983 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -943044528, now seen corresponding path program 1 times [2025-03-04 10:53:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993320300] [2025-03-04 10:53:44,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:45,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:45,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:45,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:45,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339110569] [2025-03-04 10:53:45,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:45,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:45,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:53:45,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:45,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:45,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:45,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:45,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:45,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:45,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:45,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993320300] [2025-03-04 10:53:45,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339110569] [2025-03-04 10:53:45,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339110569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:45,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:45,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:53:45,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312370343] [2025-03-04 10:53:45,544 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:45,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:45,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:45,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:45,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:45,545 INFO L87 Difference]: Start difference. First operand 471 states and 543 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:46,048 INFO L93 Difference]: Finished difference Result 492 states and 550 transitions. [2025-03-04 10:53:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2025-03-04 10:53:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:46,050 INFO L225 Difference]: With dead ends: 492 [2025-03-04 10:53:46,050 INFO L226 Difference]: Without dead ends: 477 [2025-03-04 10:53:46,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:46,051 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 114 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:46,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 393 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-04 10:53:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2025-03-04 10:53:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 351 states have (on average 1.3732193732193732) internal successors, (482), 446 states have internal predecessors, (482), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 534 transitions. [2025-03-04 10:53:46,076 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 534 transitions. Word has length 122 [2025-03-04 10:53:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 534 transitions. [2025-03-04 10:53:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 534 transitions. [2025-03-04 10:53:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 10:53:46,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:46,077 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:46,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:46,277 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,SelfDestructingSolverStorable21 [2025-03-04 10:53:46,278 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:46,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash 830390915, now seen corresponding path program 1 times [2025-03-04 10:53:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048824529] [2025-03-04 10:53:46,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 10:53:46,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 10:53:46,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:46,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:46,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:46,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048824529] [2025-03-04 10:53:46,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048824529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:46,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191271087] [2025-03-04 10:53:46,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:46,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:46,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:46,371 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:46,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:53:46,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 10:53:46,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 10:53:46,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:46,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:46,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:46,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:46,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191271087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:46,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2025-03-04 10:53:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978839042] [2025-03-04 10:53:46,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:46,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:46,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:46,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:46,666 INFO L87 Difference]: Start difference. First operand 474 states and 534 transitions. Second operand has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:47,450 INFO L93 Difference]: Finished difference Result 489 states and 535 transitions. [2025-03-04 10:53:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-03-04 10:53:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:47,451 INFO L225 Difference]: With dead ends: 489 [2025-03-04 10:53:47,451 INFO L226 Difference]: Without dead ends: 487 [2025-03-04 10:53:47,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:47,452 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 284 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:47,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 521 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:53:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-04 10:53:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 474. [2025-03-04 10:53:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 351 states have (on average 1.3675213675213675) internal successors, (480), 446 states have internal predecessors, (480), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 532 transitions. [2025-03-04 10:53:47,461 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 532 transitions. Word has length 123 [2025-03-04 10:53:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:47,462 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 532 transitions. [2025-03-04 10:53:47,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 532 transitions. [2025-03-04 10:53:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 10:53:47,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:47,463 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:47,469 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 10:53:47,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:53:47,664 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -135926465, now seen corresponding path program 1 times [2025-03-04 10:53:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138136728] [2025-03-04 10:53:47,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:47,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:47,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138136728] [2025-03-04 10:53:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138136728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801481004] [2025-03-04 10:53:47,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:47,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:47,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:47,740 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:47,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:53:47,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:47,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:47,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:47,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:47,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:47,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:48,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:48,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801481004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:48,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:48,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-04 10:53:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372436143] [2025-03-04 10:53:48,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:48,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:48,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:48,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:48,164 INFO L87 Difference]: Start difference. First operand 474 states and 532 transitions. Second operand has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:49,378 INFO L93 Difference]: Finished difference Result 474 states and 532 transitions. [2025-03-04 10:53:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:49,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-03-04 10:53:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:49,380 INFO L225 Difference]: With dead ends: 474 [2025-03-04 10:53:49,380 INFO L226 Difference]: Without dead ends: 446 [2025-03-04 10:53:49,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:49,380 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 495 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:49,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 322 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 10:53:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-04 10:53:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-03-04 10:53:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 351 states have (on average 1.2735042735042734) internal successors, (447), 418 states have internal predecessors, (447), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 499 transitions. [2025-03-04 10:53:49,389 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 499 transitions. Word has length 127 [2025-03-04 10:53:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:49,389 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 499 transitions. [2025-03-04 10:53:49,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 499 transitions. [2025-03-04 10:53:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 10:53:49,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:49,390 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:49,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:53:49,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:53:49,591 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:49,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1929537541, now seen corresponding path program 1 times [2025-03-04 10:53:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349175429] [2025-03-04 10:53:49,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:49,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:53:49,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:53:49,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:49,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:49,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349175429] [2025-03-04 10:53:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349175429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037053823] [2025-03-04 10:53:49,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:49,682 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:49,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:53:49,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:53:49,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:53:49,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:49,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:49,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:49,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:50,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037053823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:50,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:50,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2025-03-04 10:53:50,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510820714] [2025-03-04 10:53:50,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:50,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:50,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:50,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:50,823 INFO L87 Difference]: Start difference. First operand 446 states and 499 transitions. Second operand has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:51,781 INFO L93 Difference]: Finished difference Result 446 states and 499 transitions. [2025-03-04 10:53:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:51,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2025-03-04 10:53:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:51,783 INFO L225 Difference]: With dead ends: 446 [2025-03-04 10:53:51,783 INFO L226 Difference]: Without dead ends: 406 [2025-03-04 10:53:51,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:53:51,783 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 351 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:51,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 493 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:53:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-04 10:53:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-04 10:53:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.2538699690402477) internal successors, (405), 380 states have internal predecessors, (405), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 453 transitions. [2025-03-04 10:53:51,796 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 453 transitions. Word has length 131 [2025-03-04 10:53:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:51,796 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 453 transitions. [2025-03-04 10:53:51,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 453 transitions. [2025-03-04 10:53:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 10:53:51,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:51,798 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:51,804 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 10:53:52,002 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,SelfDestructingSolverStorable24 [2025-03-04 10:53:52,002 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:52,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1915178913, now seen corresponding path program 1 times [2025-03-04 10:53:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105126633] [2025-03-04 10:53:52,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:52,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 10:53:52,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:53:52,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:52,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 10:53:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105126633] [2025-03-04 10:53:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105126633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:52,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852859345] [2025-03-04 10:53:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:52,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:52,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:52,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:52,056 INFO L87 Difference]: Start difference. First operand 406 states and 453 transitions. Second operand has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:52,268 INFO L93 Difference]: Finished difference Result 406 states and 453 transitions. [2025-03-04 10:53:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:52,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 160 [2025-03-04 10:53:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:52,269 INFO L225 Difference]: With dead ends: 406 [2025-03-04 10:53:52,269 INFO L226 Difference]: Without dead ends: 405 [2025-03-04 10:53:52,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:52,270 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 272 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:52,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 182 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-04 10:53:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-03-04 10:53:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 323 states have (on average 1.2476780185758514) internal successors, (403), 379 states have internal predecessors, (403), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 451 transitions. [2025-03-04 10:53:52,282 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 451 transitions. Word has length 160 [2025-03-04 10:53:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:52,282 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 451 transitions. [2025-03-04 10:53:52,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 451 transitions. [2025-03-04 10:53:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 10:53:52,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:52,283 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:52,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:53:52,284 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1934104488, now seen corresponding path program 1 times [2025-03-04 10:53:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439856680] [2025-03-04 10:53:52,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:52,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 10:53:52,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:53:52,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:52,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439856680] [2025-03-04 10:53:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439856680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587616401] [2025-03-04 10:53:52,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:52,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:52,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:52,360 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:52,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:53:52,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 10:53:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:53:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:52,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:52,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:52,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:52,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587616401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:52,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:52,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:53:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619429960] [2025-03-04 10:53:52,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:52,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:52,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:52,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:52,677 INFO L87 Difference]: Start difference. First operand 405 states and 451 transitions. Second operand has 9 states, 8 states have (on average 34.25) internal successors, (274), 9 states have internal predecessors, (274), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:52,943 INFO L93 Difference]: Finished difference Result 433 states and 460 transitions. [2025-03-04 10:53:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:53:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 34.25) internal successors, (274), 9 states have internal predecessors, (274), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 167 [2025-03-04 10:53:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:52,945 INFO L225 Difference]: With dead ends: 433 [2025-03-04 10:53:52,945 INFO L226 Difference]: Without dead ends: 431 [2025-03-04 10:53:52,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:52,945 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 710 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:52,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 610 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-04 10:53:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 403. [2025-03-04 10:53:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2352941176470589) internal successors, (399), 377 states have internal predecessors, (399), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 447 transitions. [2025-03-04 10:53:52,954 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 447 transitions. Word has length 167 [2025-03-04 10:53:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:52,954 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 447 transitions. [2025-03-04 10:53:52,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 34.25) internal successors, (274), 9 states have internal predecessors, (274), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 447 transitions. [2025-03-04 10:53:52,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 10:53:52,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:52,955 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:52,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:53,159 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -172302884, now seen corresponding path program 1 times [2025-03-04 10:53:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767066122] [2025-03-04 10:53:53,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:53,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:53:53,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:53:53,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053601672] [2025-03-04 10:53:53,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:53,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:53,181 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 10:53:53,181 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 10:53:53,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:53:53,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:53:53,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:53,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:53:53,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:53,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767066122] [2025-03-04 10:53:54,092 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053601672] [2025-03-04 10:53:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053601672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:54,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:54,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:54,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392561757] [2025-03-04 10:53:54,093 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:54,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:54,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:54,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:54,093 INFO L87 Difference]: Start difference. First operand 403 states and 447 transitions. Second operand has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:54,436 INFO L93 Difference]: Finished difference Result 404 states and 447 transitions. [2025-03-04 10:53:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:54,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 168 [2025-03-04 10:53:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:54,438 INFO L225 Difference]: With dead ends: 404 [2025-03-04 10:53:54,438 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 10:53:54,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:54,438 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 58 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:54,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 366 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 10:53:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 10:53:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2321981424148607) internal successors, (398), 377 states have internal predecessors, (398), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 446 transitions. [2025-03-04 10:53:54,446 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 446 transitions. Word has length 168 [2025-03-04 10:53:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:54,446 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 446 transitions. [2025-03-04 10:53:54,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 446 transitions. [2025-03-04 10:53:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 10:53:54,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:54,447 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:54,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:53:54,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:53:54,648 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:54,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1046421978, now seen corresponding path program 1 times [2025-03-04 10:53:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:54,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570301224] [2025-03-04 10:53:54,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:54,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:54,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 10:53:54,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 10:53:54,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:54,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:54,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118358200] [2025-03-04 10:53:54,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:54,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:54,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:54,669 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 10:53:54,670 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 10:53:54,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 10:53:54,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 10:53:54,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:54,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:54,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:53:54,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:55,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570301224] [2025-03-04 10:53:55,132 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118358200] [2025-03-04 10:53:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118358200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:55,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:55,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:53:55,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887455010] [2025-03-04 10:53:55,132 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:55,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:55,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:55,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:55,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:55,133 INFO L87 Difference]: Start difference. First operand 403 states and 446 transitions. Second operand has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:55,515 INFO L93 Difference]: Finished difference Result 414 states and 446 transitions. [2025-03-04 10:53:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 169 [2025-03-04 10:53:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:55,517 INFO L225 Difference]: With dead ends: 414 [2025-03-04 10:53:55,517 INFO L226 Difference]: Without dead ends: 413 [2025-03-04 10:53:55,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:55,517 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 117 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:55,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 438 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-04 10:53:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 403. [2025-03-04 10:53:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2291021671826625) internal successors, (397), 377 states have internal predecessors, (397), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 445 transitions. [2025-03-04 10:53:55,531 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 445 transitions. Word has length 169 [2025-03-04 10:53:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:55,531 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 445 transitions. [2025-03-04 10:53:55,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 445 transitions. [2025-03-04 10:53:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 10:53:55,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:55,532 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:53:55,539 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 10:53:55,732 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,SelfDestructingSolverStorable28 [2025-03-04 10:53:55,733 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:55,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1084385192, now seen corresponding path program 1 times [2025-03-04 10:53:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911190007] [2025-03-04 10:53:55,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:55,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 10:53:55,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 10:53:55,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:55,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:55,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126101531] [2025-03-04 10:53:55,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:55,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:55,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:55,754 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 10:53:55,757 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 10:53:55,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 10:53:55,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 10:53:55,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:55,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:53:55,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:56,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911190007] [2025-03-04 10:53:57,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126101531] [2025-03-04 10:53:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126101531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:57,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 10:53:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632101545] [2025-03-04 10:53:57,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:57,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:57,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:57,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:57,275 INFO L87 Difference]: Start difference. First operand 403 states and 445 transitions. Second operand has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:59,310 INFO L93 Difference]: Finished difference Result 411 states and 445 transitions. [2025-03-04 10:53:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:53:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 172 [2025-03-04 10:53:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:59,311 INFO L225 Difference]: With dead ends: 411 [2025-03-04 10:53:59,311 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 10:53:59,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:53:59,312 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 468 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:59,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 283 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 10:53:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 10:53:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 10:53:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2043343653250773) internal successors, (389), 377 states have internal predecessors, (389), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 437 transitions. [2025-03-04 10:53:59,322 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 437 transitions. Word has length 172 [2025-03-04 10:53:59,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:59,322 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 437 transitions. [2025-03-04 10:53:59,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 437 transitions. [2025-03-04 10:53:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 10:53:59,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:59,323 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:53:59,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:59,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:59,524 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:59,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -153949247, now seen corresponding path program 1 times [2025-03-04 10:53:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-03-04 10:53:59,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:59,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 10:53:59,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 10:53:59,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:59,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:59,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052774428] [2025-03-04 10:53:59,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:59,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:59,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:59,548 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:59,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:53:59,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 10:53:59,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 10:53:59,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:59,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:59,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:53:59,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:00,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:00,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-03-04 10:54:00,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052774428] [2025-03-04 10:54:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052774428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:00,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-03-04 10:54:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013156838] [2025-03-04 10:54:00,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:00,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:54:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:00,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:54:00,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:00,815 INFO L87 Difference]: Start difference. First operand 403 states and 437 transitions. Second operand has 15 states, 14 states have (on average 18.714285714285715) internal successors, (262), 15 states have internal predecessors, (262), 7 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-04 10:54:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:01,862 INFO L93 Difference]: Finished difference Result 473 states and 535 transitions. [2025-03-04 10:54:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:54:01,862 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 18.714285714285715) internal successors, (262), 15 states have internal predecessors, (262), 7 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 191 [2025-03-04 10:54:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:01,863 INFO L225 Difference]: With dead ends: 473 [2025-03-04 10:54:01,863 INFO L226 Difference]: Without dead ends: 470 [2025-03-04 10:54:01,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:54:01,864 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 296 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:01,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 241 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:54:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-04 10:54:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2025-03-04 10:54:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 383 states have (on average 1.2297650130548303) internal successors, (471), 437 states have internal predecessors, (471), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 531 transitions. [2025-03-04 10:54:01,878 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 531 transitions. Word has length 191 [2025-03-04 10:54:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:01,879 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 531 transitions. [2025-03-04 10:54:01,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 18.714285714285715) internal successors, (262), 15 states have internal predecessors, (262), 7 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-04 10:54:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 531 transitions. [2025-03-04 10:54:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 10:54:01,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:01,879 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:54:01,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:02,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:02,080 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -477459268, now seen corresponding path program 1 times [2025-03-04 10:54:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296710822] [2025-03-04 10:54:02,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:02,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:54:02,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:54:02,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:02,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296710822] [2025-03-04 10:54:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296710822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487945762] [2025-03-04 10:54:02,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:02,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:02,219 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:02,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:54:02,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:54:02,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:54:02,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:02,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:02,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:54:02,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:02,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:02,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487945762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:02,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 10:54:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545484465] [2025-03-04 10:54:02,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:02,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:02,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:02,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:02,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:02,707 INFO L87 Difference]: Start difference. First operand 469 states and 531 transitions. Second operand has 11 states, 10 states have (on average 26.4) internal successors, (264), 11 states have internal predecessors, (264), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 10:54:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:03,587 INFO L93 Difference]: Finished difference Result 469 states and 531 transitions. [2025-03-04 10:54:03,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:54:03,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 26.4) internal successors, (264), 11 states have internal predecessors, (264), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 192 [2025-03-04 10:54:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:03,588 INFO L225 Difference]: With dead ends: 469 [2025-03-04 10:54:03,588 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 10:54:03,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:54:03,589 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 415 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:03,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 207 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:54:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 10:54:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-04 10:54:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 383 states have (on average 1.2088772845953002) internal successors, (463), 433 states have internal predecessors, (463), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 523 transitions. [2025-03-04 10:54:03,602 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 523 transitions. Word has length 192 [2025-03-04 10:54:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:03,602 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 523 transitions. [2025-03-04 10:54:03,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 26.4) internal successors, (264), 11 states have internal predecessors, (264), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 10:54:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 523 transitions. [2025-03-04 10:54:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 10:54:03,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:03,603 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 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 10:54:03,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:03,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:03,804 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:03,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 14131833, now seen corresponding path program 1 times [2025-03-04 10:54:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791554411] [2025-03-04 10:54:03,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:03,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:54:03,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:54:03,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:03,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819911004] [2025-03-04 10:54:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:03,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:03,826 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:03,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:54:03,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:54:03,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:54:03,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:03,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:54:03,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:03,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:04,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791554411] [2025-03-04 10:54:04,045 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819911004] [2025-03-04 10:54:04,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819911004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:04,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:54:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721253368] [2025-03-04 10:54:04,046 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:54:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:04,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:54:04,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:54:04,046 INFO L87 Difference]: Start difference. First operand 465 states and 523 transitions. Second operand has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:54:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:04,157 INFO L93 Difference]: Finished difference Result 583 states and 615 transitions. [2025-03-04 10:54:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:54:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 192 [2025-03-04 10:54:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:04,159 INFO L225 Difference]: With dead ends: 583 [2025-03-04 10:54:04,159 INFO L226 Difference]: Without dead ends: 582 [2025-03-04 10:54:04,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:54:04,160 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 224 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:04,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 644 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-04 10:54:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 465. [2025-03-04 10:54:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 383 states have (on average 1.206266318537859) internal successors, (462), 433 states have internal predecessors, (462), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 522 transitions. [2025-03-04 10:54:04,180 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 522 transitions. Word has length 192 [2025-03-04 10:54:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:04,180 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 522 transitions. [2025-03-04 10:54:04,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:54:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 522 transitions. [2025-03-04 10:54:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 10:54:04,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:04,181 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:54:04,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:54:04,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:54:04,382 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:04,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash -840399496, now seen corresponding path program 1 times [2025-03-04 10:54:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:04,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530967289] [2025-03-04 10:54:04,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:04,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 10:54:04,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 10:54:04,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:04,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:04,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683046163] [2025-03-04 10:54:04,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:04,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:04,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:04,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:04,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:54:04,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 10:54:04,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 10:54:04,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:04,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:04,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:54:04,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:04,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:05,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530967289] [2025-03-04 10:54:05,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:05,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683046163] [2025-03-04 10:54:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683046163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:05,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:05,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:54:05,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868115423] [2025-03-04 10:54:05,623 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:05,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:54:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:05,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:54:05,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:05,623 INFO L87 Difference]: Start difference. First operand 465 states and 522 transitions. Second operand has 8 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:54:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:06,195 INFO L93 Difference]: Finished difference Result 467 states and 522 transitions. [2025-03-04 10:54:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:06,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 196 [2025-03-04 10:54:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:06,198 INFO L225 Difference]: With dead ends: 467 [2025-03-04 10:54:06,198 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 10:54:06,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:54:06,198 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 84 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:06,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 305 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:54:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 10:54:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-04 10:54:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 383 states have (on average 1.2010443864229765) internal successors, (460), 433 states have internal predecessors, (460), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 520 transitions. [2025-03-04 10:54:06,212 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 520 transitions. Word has length 196 [2025-03-04 10:54:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:06,212 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 520 transitions. [2025-03-04 10:54:06,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:54:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 520 transitions. [2025-03-04 10:54:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-04 10:54:06,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:06,213 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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 10:54:06,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:06,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 10:54:06,413 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:06,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1244043865, now seen corresponding path program 2 times [2025-03-04 10:54:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733492352] [2025-03-04 10:54:06,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:06,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 10:54:06,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 10:54:06,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:06,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:06,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477193199] [2025-03-04 10:54:06,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:06,435 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:06,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:54:06,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 10:54:06,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 10:54:06,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:06,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:06,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:54:06,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:54:06,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:07,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733492352] [2025-03-04 10:54:07,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477193199] [2025-03-04 10:54:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477193199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:07,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:07,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:54:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227361647] [2025-03-04 10:54:07,061 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:07,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:07,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:07,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:07,061 INFO L87 Difference]: Start difference. First operand 465 states and 520 transitions. Second operand has 7 states, 6 states have (on average 22.833333333333332) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:54:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:07,670 INFO L93 Difference]: Finished difference Result 548 states and 616 transitions. [2025-03-04 10:54:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.833333333333332) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 199 [2025-03-04 10:54:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:07,672 INFO L225 Difference]: With dead ends: 548 [2025-03-04 10:54:07,672 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 10:54:07,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:07,673 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 175 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:07,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 767 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:54:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 10:54:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2025-03-04 10:54:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 434 states have (on average 1.2027649769585254) internal successors, (522), 484 states have internal predecessors, (522), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:54:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 588 transitions. [2025-03-04 10:54:07,698 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 588 transitions. Word has length 199 [2025-03-04 10:54:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:07,698 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 588 transitions. [2025-03-04 10:54:07,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.833333333333332) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:54:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 588 transitions. [2025-03-04 10:54:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-04 10:54:07,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:07,699 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:54:07,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:54:07,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:07,899 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:07,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1525252919, now seen corresponding path program 2 times [2025-03-04 10:54:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:07,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645693090] [2025-03-04 10:54:07,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:07,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes. [2025-03-04 10:54:07,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 10:54:07,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:07,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:54:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:08,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645693090] [2025-03-04 10:54:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645693090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:08,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481564204] [2025-03-04 10:54:08,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:08,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:08,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:08,019 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:08,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:54:08,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes. [2025-03-04 10:54:08,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 10:54:08,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:08,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:54:08,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:54:08,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:54:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481564204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:08,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:08,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:54:08,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416353509] [2025-03-04 10:54:08,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:08,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:54:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:08,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:54:08,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:08,560 INFO L87 Difference]: Start difference. First operand 519 states and 588 transitions. Second operand has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:54:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:09,222 INFO L93 Difference]: Finished difference Result 571 states and 638 transitions. [2025-03-04 10:54:09,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:54:09,222 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) Word has length 201 [2025-03-04 10:54:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:09,224 INFO L225 Difference]: With dead ends: 571 [2025-03-04 10:54:09,224 INFO L226 Difference]: Without dead ends: 570 [2025-03-04 10:54:09,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:54:09,224 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 582 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:09,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 639 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:54:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-04 10:54:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2025-03-04 10:54:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 464 states have (on average 1.1961206896551724) internal successors, (555), 514 states have internal predecessors, (555), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 10:54:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 627 transitions. [2025-03-04 10:54:09,240 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 627 transitions. Word has length 201 [2025-03-04 10:54:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:09,240 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 627 transitions. [2025-03-04 10:54:09,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:54:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 627 transitions. [2025-03-04 10:54:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 10:54:09,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:09,241 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:54:09,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 10:54:09,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:09,445 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:09,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 38200446, now seen corresponding path program 2 times [2025-03-04 10:54:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624998084] [2025-03-04 10:54:09,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:09,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 10:54:09,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:54:09,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:09,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980191270] [2025-03-04 10:54:09,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:09,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:09,463 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:09,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:54:09,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 10:54:09,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:54:09,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:09,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:09,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:54:09,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:54:09,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:54:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624998084] [2025-03-04 10:54:10,269 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980191270] [2025-03-04 10:54:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980191270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:10,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:10,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:54:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587463903] [2025-03-04 10:54:10,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:10,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:54:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:10,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:54:10,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:54:10,270 INFO L87 Difference]: Start difference. First operand 552 states and 627 transitions. Second operand has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:54:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:12,370 INFO L93 Difference]: Finished difference Result 593 states and 652 transitions. [2025-03-04 10:54:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:54:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 202 [2025-03-04 10:54:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:12,372 INFO L225 Difference]: With dead ends: 593 [2025-03-04 10:54:12,372 INFO L226 Difference]: Without dead ends: 458 [2025-03-04 10:54:12,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:54:12,373 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 742 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:12,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1034 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 10:54:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-04 10:54:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 444. [2025-03-04 10:54:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 364 states have (on average 1.1758241758241759) internal successors, (428), 412 states have internal predecessors, (428), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 488 transitions. [2025-03-04 10:54:12,386 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 488 transitions. Word has length 202 [2025-03-04 10:54:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 488 transitions. [2025-03-04 10:54:12,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:54:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 488 transitions. [2025-03-04 10:54:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-04 10:54:12,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:12,387 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 10:54:12,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:54:12,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:54:12,588 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 138330569, now seen corresponding path program 1 times [2025-03-04 10:54:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638503560] [2025-03-04 10:54:12,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:12,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-04 10:54:12,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 10:54:12,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:12,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-04 10:54:12,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:12,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638503560] [2025-03-04 10:54:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638503560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:12,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:54:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692103663] [2025-03-04 10:54:12,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:12,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:54:12,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:12,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:54:12,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:12,638 INFO L87 Difference]: Start difference. First operand 444 states and 488 transitions. Second operand has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:54:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:12,805 INFO L93 Difference]: Finished difference Result 444 states and 488 transitions. [2025-03-04 10:54:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:54:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 244 [2025-03-04 10:54:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:12,807 INFO L225 Difference]: With dead ends: 444 [2025-03-04 10:54:12,807 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 10:54:12,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:12,807 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 119 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:12,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 144 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 10:54:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-04 10:54:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 364 states have (on average 1.1703296703296704) internal successors, (426), 411 states have internal predecessors, (426), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 486 transitions. [2025-03-04 10:54:12,821 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 486 transitions. Word has length 244 [2025-03-04 10:54:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:12,821 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 486 transitions. [2025-03-04 10:54:12,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:54:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 486 transitions. [2025-03-04 10:54:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 10:54:12,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:12,822 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:12,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 10:54:12,822 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:12,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1032234614, now seen corresponding path program 2 times [2025-03-04 10:54:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529568096] [2025-03-04 10:54:12,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:12,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-03-04 10:54:12,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 10:54:12,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:12,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757308548] [2025-03-04 10:54:12,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:12,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:12,844 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:12,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:54:12,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-03-04 10:54:12,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 10:54:12,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:12,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:12,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:54:12,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:13,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529568096] [2025-03-04 10:54:13,952 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757308548] [2025-03-04 10:54:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757308548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:13,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:54:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695037370] [2025-03-04 10:54:13,952 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:13,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:13,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:13,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:13,953 INFO L87 Difference]: Start difference. First operand 443 states and 486 transitions. Second operand has 10 states, 9 states have (on average 19.0) internal successors, (171), 10 states have internal predecessors, (171), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:54:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:14,774 INFO L93 Difference]: Finished difference Result 444 states and 486 transitions. [2025-03-04 10:54:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:54:14,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 19.0) internal successors, (171), 10 states have internal predecessors, (171), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 248 [2025-03-04 10:54:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:14,776 INFO L225 Difference]: With dead ends: 444 [2025-03-04 10:54:14,776 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 10:54:14,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:54:14,777 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 109 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:14,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 516 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:54:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 10:54:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-04 10:54:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 364 states have (on average 1.1675824175824177) internal successors, (425), 411 states have internal predecessors, (425), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 485 transitions. [2025-03-04 10:54:14,792 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 485 transitions. Word has length 248 [2025-03-04 10:54:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:14,792 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 485 transitions. [2025-03-04 10:54:14,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 19.0) internal successors, (171), 10 states have internal predecessors, (171), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:54:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 485 transitions. [2025-03-04 10:54:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 10:54:14,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:14,793 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:14,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:54:14,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:54:14,994 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:14,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:14,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1934501832, now seen corresponding path program 2 times [2025-03-04 10:54:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:14,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-04 10:54:14,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:14,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:15,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-03-04 10:54:15,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:54:15,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:15,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618175284] [2025-03-04 10:54:15,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:15,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:15,020 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:15,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:54:15,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-03-04 10:54:15,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:54:15,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:15,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:15,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:54:15,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:15,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:15,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-04 10:54:15,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:15,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618175284] [2025-03-04 10:54:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618175284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:15,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:15,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:54:15,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481824085] [2025-03-04 10:54:15,622 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:15,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:54:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:15,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:54:15,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:54:15,622 INFO L87 Difference]: Start difference. First operand 443 states and 485 transitions. Second operand has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:54:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:15,917 INFO L93 Difference]: Finished difference Result 444 states and 485 transitions. [2025-03-04 10:54:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 249 [2025-03-04 10:54:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:15,919 INFO L225 Difference]: With dead ends: 444 [2025-03-04 10:54:15,919 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 10:54:15,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:54:15,919 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 92 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:15,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 956 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 10:54:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-04 10:54:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 364 states have (on average 1.164835164835165) internal successors, (424), 411 states have internal predecessors, (424), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 484 transitions. [2025-03-04 10:54:15,932 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 484 transitions. Word has length 249 [2025-03-04 10:54:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:15,933 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 484 transitions. [2025-03-04 10:54:15,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:54:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 484 transitions. [2025-03-04 10:54:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 10:54:15,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:15,934 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:15,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:16,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:54:16,135 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash -872772346, now seen corresponding path program 2 times [2025-03-04 10:54:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967280727] [2025-03-04 10:54:16,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:16,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:16,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-04 10:54:16,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 10:54:16,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:16,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976563811] [2025-03-04 10:54:16,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:16,157 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:16,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:54:16,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-04 10:54:16,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 10:54:16,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:16,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:16,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:54:16,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:17,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967280727] [2025-03-04 10:54:18,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976563811] [2025-03-04 10:54:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976563811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:18,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2025-03-04 10:54:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750552639] [2025-03-04 10:54:18,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:54:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:18,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:54:18,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:54:18,581 INFO L87 Difference]: Start difference. First operand 443 states and 484 transitions. Second operand has 19 states, 18 states have (on average 19.22222222222222) internal successors, (346), 19 states have internal predecessors, (346), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-04 10:54:24,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:54:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:28,269 INFO L93 Difference]: Finished difference Result 495 states and 544 transitions. [2025-03-04 10:54:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:54:28,269 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 19.22222222222222) internal successors, (346), 19 states have internal predecessors, (346), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 252 [2025-03-04 10:54:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:28,270 INFO L225 Difference]: With dead ends: 495 [2025-03-04 10:54:28,270 INFO L226 Difference]: Without dead ends: 490 [2025-03-04 10:54:28,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:54:28,271 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 919 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:28,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 369 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-03-04 10:54:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-04 10:54:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 482. [2025-03-04 10:54:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 400 states have (on average 1.17) internal successors, (468), 447 states have internal predecessors, (468), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:54:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 534 transitions. [2025-03-04 10:54:28,289 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 534 transitions. Word has length 252 [2025-03-04 10:54:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:28,289 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 534 transitions. [2025-03-04 10:54:28,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 19.22222222222222) internal successors, (346), 19 states have internal predecessors, (346), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-04 10:54:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 534 transitions. [2025-03-04 10:54:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-04 10:54:28,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:28,291 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:54:28,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:28,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:28,492 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1808710063, now seen corresponding path program 1 times [2025-03-04 10:54:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232098070] [2025-03-04 10:54:28,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:28,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 10:54:28,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 10:54:28,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:28,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028921096] [2025-03-04 10:54:28,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:28,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:28,514 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:28,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:54:28,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 10:54:28,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 10:54:28,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:28,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:28,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:54:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:28,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:28,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232098070] [2025-03-04 10:54:28,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028921096] [2025-03-04 10:54:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028921096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:28,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:28,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:54:28,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805295709] [2025-03-04 10:54:28,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:28,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:28,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:28,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:28,956 INFO L87 Difference]: Start difference. First operand 482 states and 534 transitions. Second operand has 10 states, 9 states have (on average 40.22222222222222) internal successors, (362), 10 states have internal predecessors, (362), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:54:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:29,200 INFO L93 Difference]: Finished difference Result 635 states and 676 transitions. [2025-03-04 10:54:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:29,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 40.22222222222222) internal successors, (362), 10 states have internal predecessors, (362), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 261 [2025-03-04 10:54:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:29,202 INFO L225 Difference]: With dead ends: 635 [2025-03-04 10:54:29,202 INFO L226 Difference]: Without dead ends: 633 [2025-03-04 10:54:29,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:54:29,203 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1056 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:29,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 1460 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-04 10:54:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 481. [2025-03-04 10:54:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 400 states have (on average 1.1625) internal successors, (465), 446 states have internal predecessors, (465), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:54:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 531 transitions. [2025-03-04 10:54:29,223 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 531 transitions. Word has length 261 [2025-03-04 10:54:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:29,223 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 531 transitions. [2025-03-04 10:54:29,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 40.22222222222222) internal successors, (362), 10 states have internal predecessors, (362), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:54:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 531 transitions. [2025-03-04 10:54:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 10:54:29,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:29,224 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:29,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:29,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:29,425 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:29,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2125434353, now seen corresponding path program 1 times [2025-03-04 10:54:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384091468] [2025-03-04 10:54:29,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:29,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:29,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 10:54:29,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 10:54:29,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:29,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:29,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:29,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384091468] [2025-03-04 10:54:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384091468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:29,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:29,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:54:29,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948976565] [2025-03-04 10:54:29,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:29,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:54:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:29,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:54:29,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:54:29,523 INFO L87 Difference]: Start difference. First operand 481 states and 531 transitions. Second operand has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:54:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:29,907 INFO L93 Difference]: Finished difference Result 481 states and 531 transitions. [2025-03-04 10:54:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 275 [2025-03-04 10:54:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:29,908 INFO L225 Difference]: With dead ends: 481 [2025-03-04 10:54:29,908 INFO L226 Difference]: Without dead ends: 479 [2025-03-04 10:54:29,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:54:29,909 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 250 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:29,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 332 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:54:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-04 10:54:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-03-04 10:54:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 400 states have (on average 1.1525) internal successors, (461), 444 states have internal predecessors, (461), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:54:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 527 transitions. [2025-03-04 10:54:29,928 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 527 transitions. Word has length 275 [2025-03-04 10:54:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:29,928 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 527 transitions. [2025-03-04 10:54:29,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:54:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 527 transitions. [2025-03-04 10:54:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-04 10:54:29,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:29,929 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:29,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 10:54:29,930 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1463955418, now seen corresponding path program 2 times [2025-03-04 10:54:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365894652] [2025-03-04 10:54:29,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:29,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 276 statements into 2 equivalence classes. [2025-03-04 10:54:29,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:54:29,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:29,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365894652] [2025-03-04 10:54:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365894652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514107815] [2025-03-04 10:54:30,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:30,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:30,126 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:30,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:54:30,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 276 statements into 2 equivalence classes. [2025-03-04 10:54:30,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:54:30,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:30,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:30,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:54:30,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:30,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514107815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:35,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:54:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793381357] [2025-03-04 10:54:35,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:35,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:54:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:35,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:54:35,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=352, Unknown=1, NotChecked=0, Total=420 [2025-03-04 10:54:35,577 INFO L87 Difference]: Start difference. First operand 479 states and 527 transitions. Second operand has 16 states, 15 states have (on average 25.466666666666665) internal successors, (382), 16 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:37,171 INFO L93 Difference]: Finished difference Result 479 states and 527 transitions. [2025-03-04 10:54:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:54:37,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 25.466666666666665) internal successors, (382), 16 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) Word has length 276 [2025-03-04 10:54:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:37,173 INFO L225 Difference]: With dead ends: 479 [2025-03-04 10:54:37,173 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 10:54:37,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=179, Invalid=750, Unknown=1, NotChecked=0, Total=930 [2025-03-04 10:54:37,173 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 541 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:37,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 400 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 10:54:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 10:54:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-04 10:54:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 368 states have (on average 1.1548913043478262) internal successors, (425), 410 states have internal predecessors, (425), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 10:54:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 487 transitions. [2025-03-04 10:54:37,192 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 487 transitions. Word has length 276 [2025-03-04 10:54:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:37,192 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 487 transitions. [2025-03-04 10:54:37,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 25.466666666666665) internal successors, (382), 16 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 487 transitions. [2025-03-04 10:54:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 10:54:37,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:37,193 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 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 10:54:37,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:37,394 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash 623126763, now seen corresponding path program 3 times [2025-03-04 10:54:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527568441] [2025-03-04 10:54:37,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:37,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 279 statements into 8 equivalence classes. [2025-03-04 10:54:37,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 10:54:37,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:54:37,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677644111] [2025-03-04 10:54:37,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:37,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:37,422 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:37,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:54:37,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 279 statements into 8 equivalence classes. [2025-03-04 10:54:37,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 92 of 279 statements. [2025-03-04 10:54:37,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:54:37,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:37,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:54:37,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 146 proven. 94 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2025-03-04 10:54:44,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527568441] [2025-03-04 10:54:51,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677644111] [2025-03-04 10:54:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677644111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:51,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:51,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 10:54:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964380705] [2025-03-04 10:54:51,747 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:54:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:51,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:54:51,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=444, Unknown=2, NotChecked=0, Total=552 [2025-03-04 10:54:51,748 INFO L87 Difference]: Start difference. First operand 443 states and 487 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 10:55:00,390 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 []