./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.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/hard-ll_unwindbound5.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 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:10:08,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:10:08,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:10:08,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:10:08,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:10:08,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:10:08,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:10:08,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:10:08,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:10:08,477 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:10:08,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:10:08,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:10:08,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:10:08,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:10:08,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:10:08,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:10:08,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:10:08,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:10:08,479 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 -> 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe [2025-03-04 11:10:08,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:10:08,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:10:08,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:10:08,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:10:08,713 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:10:08,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-03-04 11:10:09,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97f9621f/8f098289db154a73b529af9ac7bfe0c0/FLAG373a4de28 [2025-03-04 11:10:10,033 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:10:10,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-03-04 11:10:10,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97f9621f/8f098289db154a73b529af9ac7bfe0c0/FLAG373a4de28 [2025-03-04 11:10:10,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97f9621f/8f098289db154a73b529af9ac7bfe0c0 [2025-03-04 11:10:10,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:10:10,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:10:10,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:10:10,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:10:10,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:10:10,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bcbc386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10, skipping insertion in model container [2025-03-04 11:10:10,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:10:10,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:10:10,532 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:10:10,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:10:10,555 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:10:10,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10 WrapperNode [2025-03-04 11:10:10,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:10:10,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:10:10,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:10:10,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:10:10,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,584 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-03-04 11:10:10,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:10:10,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:10:10,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:10:10,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:10:10,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,610 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:10:10,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:10:10,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:10:10,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:10:10,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:10:10,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (1/1) ... [2025-03-04 11:10:10,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:10:10,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:10,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:10:10,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:10:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:10:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:10:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:10:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:10:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:10:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:10:10,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:10:10,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:10:10,942 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-04 11:10:10,942 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:10:10,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:10:10,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:10:10,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:10:10 BoogieIcfgContainer [2025-03-04 11:10:10,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:10:10,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:10:10,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:10:10,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:10:10,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:10:10" (1/3) ... [2025-03-04 11:10:10,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628c82bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:10:10, skipping insertion in model container [2025-03-04 11:10:10,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:10:10" (2/3) ... [2025-03-04 11:10:10,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628c82bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:10:10, skipping insertion in model container [2025-03-04 11:10:10,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:10:10" (3/3) ... [2025-03-04 11:10:10,959 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound5.c [2025-03-04 11:10:10,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:10:10,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_unwindbound5.c that has 2 procedures, 84 locations, 1 initial locations, 2 loop locations, and 28 error locations. [2025-03-04 11:10:11,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:10:11,012 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;@2c28cf23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:10:11,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 11:10:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 75 states have internal predecessors, (84), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:10:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:10:11,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:11,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:10:11,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:11,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash -923470242, now seen corresponding path program 1 times [2025-03-04 11:10:11,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927314673] [2025-03-04 11:10:11,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:11,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:10:11,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:10:11,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:11,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:10:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927314673] [2025-03-04 11:10:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927314673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:11,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457233312] [2025-03-04 11:10:11,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:11,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:10:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:11,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:10:11,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:10:11,140 INFO L87 Difference]: Start difference. First operand has 84 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 75 states have internal predecessors, (84), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:10:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:11,160 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2025-03-04 11:10:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:10:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:10:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:11,165 INFO L225 Difference]: With dead ends: 164 [2025-03-04 11:10:11,166 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:10:11,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:10:11,172 INFO L435 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:11,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:10:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 11:10:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 69 states have internal predecessors, (74), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:10:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2025-03-04 11:10:11,206 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 6 [2025-03-04 11:10:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:11,207 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2025-03-04 11:10:11,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:10:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2025-03-04 11:10:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:10:11,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:11,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:10:11,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:10:11,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:11,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -923440451, now seen corresponding path program 1 times [2025-03-04 11:10:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507645854] [2025-03-04 11:10:11,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:11,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:10:11,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:10:11,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:10:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507645854] [2025-03-04 11:10:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507645854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:11,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382255496] [2025-03-04 11:10:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:11,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:11,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:11,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:11,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:10:11,303 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:10:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:11,343 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-03-04 11:10:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:10:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:10:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:11,344 INFO L225 Difference]: With dead ends: 85 [2025-03-04 11:10:11,344 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 11:10:11,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:11,345 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:11,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 202 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 11:10:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2025-03-04 11:10:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:10:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-03-04 11:10:11,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 6 [2025-03-04 11:10:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:11,354 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-03-04 11:10:11,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:10:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-03-04 11:10:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:10:11,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:11,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:11,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:10:11,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:11,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1438117135, now seen corresponding path program 1 times [2025-03-04 11:10:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:11,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325993556] [2025-03-04 11:10:11,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:10:11,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:10:11,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:11,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:10:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325993556] [2025-03-04 11:10:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325993556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:11,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14409289] [2025-03-04 11:10:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:11,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:11,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:11,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:10:11,421 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:10:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:11,457 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2025-03-04 11:10:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:11,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:10:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:11,462 INFO L225 Difference]: With dead ends: 134 [2025-03-04 11:10:11,462 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 11:10:11,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:11,463 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:11,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 229 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 11:10:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 11:10:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 75 states have internal predecessors, (80), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:10:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2025-03-04 11:10:11,472 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 7 [2025-03-04 11:10:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:11,472 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2025-03-04 11:10:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:10:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2025-03-04 11:10:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:10:11,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:11,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:10:11,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 981987439, now seen corresponding path program 1 times [2025-03-04 11:10:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:11,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497842430] [2025-03-04 11:10:11,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:11,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:10:11,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:10:11,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:11,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:11,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418978507] [2025-03-04 11:10:11,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:11,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:11,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:11,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:11,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:10:11,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:10:11,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:10:11,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:11,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:11,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:10:11,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:10:11,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497842430] [2025-03-04 11:10:11,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418978507] [2025-03-04 11:10:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418978507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:11,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717167332] [2025-03-04 11:10:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:11,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:10:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:11,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:10:11,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:11,563 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:10:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:11,628 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2025-03-04 11:10:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:10:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-04 11:10:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:11,630 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:10:11,631 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 11:10:11,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:11,632 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:11,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 135 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 11:10:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2025-03-04 11:10:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 93 states have internal predecessors, (108), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:10:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2025-03-04 11:10:11,644 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 19 [2025-03-04 11:10:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:11,644 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2025-03-04 11:10:11,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:10:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2025-03-04 11:10:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:10:11,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:11,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] [2025-03-04 11:10:11,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:10:11,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:11,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:11,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1314812425, now seen corresponding path program 1 times [2025-03-04 11:10:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:11,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551101718] [2025-03-04 11:10:11,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:10:11,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:10:11,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:11,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:11,903 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 11:10:11,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:11,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551101718] [2025-03-04 11:10:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551101718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:11,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:11,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:11,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299458890] [2025-03-04 11:10:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:10:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:11,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:10:11,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:11,908 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 11:10:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:11,951 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2025-03-04 11:10:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:10:11,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 27 [2025-03-04 11:10:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:11,952 INFO L225 Difference]: With dead ends: 106 [2025-03-04 11:10:11,952 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:10:11,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:11,953 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 47 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:11,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 70 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:10:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 11:10:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 91 states have internal predecessors, (105), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:10:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-03-04 11:10:11,960 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 27 [2025-03-04 11:10:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:11,960 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-03-04 11:10:11,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 11:10:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-03-04 11:10:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:10:11,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:11,961 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] [2025-03-04 11:10:11,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:10:11,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:11,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:11,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2104479482, now seen corresponding path program 1 times [2025-03-04 11:10:11,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:11,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828726603] [2025-03-04 11:10:11,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:11,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:11,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:10:11,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:10:11,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:11,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:12,016 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 11:10:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828726603] [2025-03-04 11:10:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828726603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:12,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521624948] [2025-03-04 11:10:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:12,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:10:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:12,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:10:12,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:12,017 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 11:10:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:12,050 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2025-03-04 11:10:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:10:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 28 [2025-03-04 11:10:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:12,051 INFO L225 Difference]: With dead ends: 115 [2025-03-04 11:10:12,052 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 11:10:12,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:12,052 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:12,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 11:10:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2025-03-04 11:10:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 91 states have internal predecessors, (104), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:10:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-03-04 11:10:12,058 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 28 [2025-03-04 11:10:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:12,058 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-03-04 11:10:12,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 11:10:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-03-04 11:10:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:10:12,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:12,059 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] [2025-03-04 11:10:12,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:10:12,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2104480699, now seen corresponding path program 1 times [2025-03-04 11:10:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697900159] [2025-03-04 11:10:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:12,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:10:12,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:10:12,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:12,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:12,142 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 11:10:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697900159] [2025-03-04 11:10:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697900159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:12,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:12,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:10:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444790787] [2025-03-04 11:10:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:12,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:12,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:12,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:12,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:12,144 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 11:10:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:12,209 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2025-03-04 11:10:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:10:12,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 28 [2025-03-04 11:10:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:12,212 INFO L225 Difference]: With dead ends: 104 [2025-03-04 11:10:12,212 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 11:10:12,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:10:12,213 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:12,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 205 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 11:10:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 11:10:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 90 states have internal predecessors, (102), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:10:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2025-03-04 11:10:12,220 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 28 [2025-03-04 11:10:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:12,221 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2025-03-04 11:10:12,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 11:10:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2025-03-04 11:10:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:10:12,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:12,222 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] [2025-03-04 11:10:12,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:10:12,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:12,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -814392210, now seen corresponding path program 1 times [2025-03-04 11:10:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022056603] [2025-03-04 11:10:12,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:10:12,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:10:12,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:12,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:12,292 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 11:10:12,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022056603] [2025-03-04 11:10:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022056603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:12,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:10:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499104437] [2025-03-04 11:10:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:12,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:12,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:12,293 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 11:10:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:12,353 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2025-03-04 11:10:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:10:12,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 29 [2025-03-04 11:10:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:12,356 INFO L225 Difference]: With dead ends: 120 [2025-03-04 11:10:12,356 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:10:12,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:10:12,357 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:12,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 294 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:10:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2025-03-04 11:10:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 93 states have internal predecessors, (103), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:10:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2025-03-04 11:10:12,365 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 29 [2025-03-04 11:10:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:12,366 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2025-03-04 11:10:12,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 11:10:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2025-03-04 11:10:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:10:12,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:12,366 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] [2025-03-04 11:10:12,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:10:12,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:12,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -946865396, now seen corresponding path program 1 times [2025-03-04 11:10:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857517507] [2025-03-04 11:10:12,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:12,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:10:12,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:10:12,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:12,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330342091] [2025-03-04 11:10:12,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:12,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:12,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:12,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:12,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:10:12,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:10:12,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:10:12,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:12,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:12,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:10:12,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:12,451 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 11:10:12,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:12,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857517507] [2025-03-04 11:10:12,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330342091] [2025-03-04 11:10:12,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330342091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:12,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:12,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:12,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947133837] [2025-03-04 11:10:12,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:10:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:12,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:10:12,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:12,452 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 11:10:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:12,497 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2025-03-04 11:10:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:10:12,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 31 [2025-03-04 11:10:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:12,502 INFO L225 Difference]: With dead ends: 145 [2025-03-04 11:10:12,502 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 11:10:12,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:12,502 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 41 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:12,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 11:10:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2025-03-04 11:10:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 111 states have internal predecessors, (130), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:10:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2025-03-04 11:10:12,509 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 31 [2025-03-04 11:10:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:12,510 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2025-03-04 11:10:12,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 11:10:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2025-03-04 11:10:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:10:12,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:12,511 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:12,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:12,711 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,SelfDestructingSolverStorable8 [2025-03-04 11:10:12,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:12,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1085019274, now seen corresponding path program 1 times [2025-03-04 11:10:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:12,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635499184] [2025-03-04 11:10:12,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:12,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:10:12,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:10:12,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:12,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:10:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635499184] [2025-03-04 11:10:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635499184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370664775] [2025-03-04 11:10:12,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:12,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:12,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:12,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:10:12,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:10:12,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:10:12,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:12,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:12,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:10:12,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:10:12,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:10:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370664775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:12,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2025-03-04 11:10:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371422061] [2025-03-04 11:10:12,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:10:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:12,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:10:12,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:10:12,948 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:10:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:13,086 INFO L93 Difference]: Finished difference Result 253 states and 306 transitions. [2025-03-04 11:10:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:10:13,086 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 33 [2025-03-04 11:10:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:13,087 INFO L225 Difference]: With dead ends: 253 [2025-03-04 11:10:13,087 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 11:10:13,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:10:13,088 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 75 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:13,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 381 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 11:10:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2025-03-04 11:10:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 142 states have internal predecessors, (174), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:10:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2025-03-04 11:10:13,101 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 33 [2025-03-04 11:10:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2025-03-04 11:10:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:10:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2025-03-04 11:10:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:10:13,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:13,102 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] [2025-03-04 11:10:13,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:10:13,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:13,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:13,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash 595421610, now seen corresponding path program 1 times [2025-03-04 11:10:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:13,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448514777] [2025-03-04 11:10:13,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:13,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:10:13,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:10:13,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:13,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:13,356 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 11:10:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448514777] [2025-03-04 11:10:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448514777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:13,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:10:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293415566] [2025-03-04 11:10:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:13,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:13,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:13,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:10:13,358 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 11:10:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:13,537 INFO L93 Difference]: Finished difference Result 190 states and 236 transitions. [2025-03-04 11:10:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 33 [2025-03-04 11:10:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:13,538 INFO L225 Difference]: With dead ends: 190 [2025-03-04 11:10:13,539 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 11:10:13,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:13,539 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 104 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:13,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 113 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 11:10:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2025-03-04 11:10:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 126 states have (on average 1.4523809523809523) internal successors, (183), 149 states have internal predecessors, (183), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:10:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 219 transitions. [2025-03-04 11:10:13,554 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 219 transitions. Word has length 33 [2025-03-04 11:10:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:13,554 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 219 transitions. [2025-03-04 11:10:13,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 11:10:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 219 transitions. [2025-03-04 11:10:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:10:13,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:13,555 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] [2025-03-04 11:10:13,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:10:13,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:13,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1278200735, now seen corresponding path program 1 times [2025-03-04 11:10:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837170326] [2025-03-04 11:10:13,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:13,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:10:13,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:10:13,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:13,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:13,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021659100] [2025-03-04 11:10:13,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:13,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:13,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:13,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:13,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:10:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:10:13,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:10:13,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:13,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:13,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:10:13,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:13,719 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 11:10:13,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837170326] [2025-03-04 11:10:13,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021659100] [2025-03-04 11:10:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021659100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:13,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:13,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:10:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013262395] [2025-03-04 11:10:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:13,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:13,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:13,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:10:13,720 INFO L87 Difference]: Start difference. First operand 173 states and 219 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 11:10:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:13,876 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2025-03-04 11:10:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:10:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 34 [2025-03-04 11:10:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:13,877 INFO L225 Difference]: With dead ends: 179 [2025-03-04 11:10:13,877 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 11:10:13,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:13,878 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:13,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 11:10:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-04 11:10:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 129 states have (on average 1.434108527131783) internal successors, (185), 152 states have internal predecessors, (185), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:10:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2025-03-04 11:10:13,897 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 34 [2025-03-04 11:10:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:13,898 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2025-03-04 11:10:13,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 11:10:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2025-03-04 11:10:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:10:13,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:13,899 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:13,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:14,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:14,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -429017238, now seen corresponding path program 1 times [2025-03-04 11:10:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914006826] [2025-03-04 11:10:14,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:14,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:10:14,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:10:14,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:14,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561282929] [2025-03-04 11:10:14,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:14,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:14,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:14,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:10:14,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:10:14,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:10:14,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:14,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:14,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:10:14,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:10:14,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914006826] [2025-03-04 11:10:14,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561282929] [2025-03-04 11:10:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561282929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:14,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:14,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:10:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410021191] [2025-03-04 11:10:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:14,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:14,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:10:14,188 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:14,250 INFO L93 Difference]: Finished difference Result 213 states and 261 transitions. [2025-03-04 11:10:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:10:14,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-04 11:10:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:14,251 INFO L225 Difference]: With dead ends: 213 [2025-03-04 11:10:14,251 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 11:10:14,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:10:14,252 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:14,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 144 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 11:10:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2025-03-04 11:10:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 159 states have internal predecessors, (190), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:10:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 230 transitions. [2025-03-04 11:10:14,268 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 230 transitions. Word has length 45 [2025-03-04 11:10:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:14,268 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 230 transitions. [2025-03-04 11:10:14,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2025-03-04 11:10:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:10:14,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:14,272 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:14,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:14,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:10:14,472 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:14,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash -414632454, now seen corresponding path program 1 times [2025-03-04 11:10:14,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:14,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007261439] [2025-03-04 11:10:14,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:14,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:10:14,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:10:14,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:14,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154998655] [2025-03-04 11:10:14,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:14,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:14,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:14,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:10:14,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:10:14,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:10:14,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:14,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:14,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:10:14,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:10:14,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007261439] [2025-03-04 11:10:14,606 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154998655] [2025-03-04 11:10:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154998655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:14,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2025-03-04 11:10:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727390201] [2025-03-04 11:10:14,607 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:14,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:14,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:14,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:14,607 INFO L87 Difference]: Start difference. First operand 185 states and 230 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:14,677 INFO L93 Difference]: Finished difference Result 281 states and 347 transitions. [2025-03-04 11:10:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:10:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-03-04 11:10:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:14,679 INFO L225 Difference]: With dead ends: 281 [2025-03-04 11:10:14,679 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 11:10:14,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:14,680 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:14,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 186 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 11:10:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 245. [2025-03-04 11:10:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.3814432989690721) internal successors, (268), 213 states have internal predecessors, (268), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 11:10:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 320 transitions. [2025-03-04 11:10:14,699 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 320 transitions. Word has length 46 [2025-03-04 11:10:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:14,699 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 320 transitions. [2025-03-04 11:10:14,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 320 transitions. [2025-03-04 11:10:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:10:14,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:14,700 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] [2025-03-04 11:10:14,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:14,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:14,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:14,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1222822311, now seen corresponding path program 1 times [2025-03-04 11:10:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309303934] [2025-03-04 11:10:14,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:14,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:10:14,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:10:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:14,971 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 11:10:14,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:14,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309303934] [2025-03-04 11:10:14,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309303934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:14,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:10:14,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970604617] [2025-03-04 11:10:14,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:14,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:14,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:14,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:14,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:10:14,973 INFO L87 Difference]: Start difference. First operand 245 states and 320 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 11:10:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:15,096 INFO L93 Difference]: Finished difference Result 256 states and 331 transitions. [2025-03-04 11:10:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:15,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 50 [2025-03-04 11:10:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:15,098 INFO L225 Difference]: With dead ends: 256 [2025-03-04 11:10:15,098 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 11:10:15,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:15,099 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:15,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 11:10:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2025-03-04 11:10:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 200 states have internal predecessors, (254), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 11:10:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2025-03-04 11:10:15,119 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 50 [2025-03-04 11:10:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:15,119 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2025-03-04 11:10:15,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 11:10:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2025-03-04 11:10:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:10:15,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:15,120 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:15,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:10:15,121 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1177873301, now seen corresponding path program 1 times [2025-03-04 11:10:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:15,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974874389] [2025-03-04 11:10:15,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:15,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:10:15,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:10:15,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:15,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:15,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974874389] [2025-03-04 11:10:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974874389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:15,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345320047] [2025-03-04 11:10:15,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:15,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:15,182 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:15,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:10:15,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:10:15,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:10:15,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:15,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:10:15,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:15,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:15,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345320047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:15,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:15,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 11:10:15,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770450633] [2025-03-04 11:10:15,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:15,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:15,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:15,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:15,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:15,317 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 11:10:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:15,450 INFO L93 Difference]: Finished difference Result 364 states and 468 transitions. [2025-03-04 11:10:15,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:15,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 54 [2025-03-04 11:10:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:15,452 INFO L225 Difference]: With dead ends: 364 [2025-03-04 11:10:15,452 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 11:10:15,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:15,452 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 127 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:15,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 252 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 11:10:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 299. [2025-03-04 11:10:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 241 states have (on average 1.4190871369294606) internal successors, (342), 260 states have internal predecessors, (342), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:10:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 408 transitions. [2025-03-04 11:10:15,477 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 408 transitions. Word has length 54 [2025-03-04 11:10:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:15,477 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 408 transitions. [2025-03-04 11:10:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 11:10:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 408 transitions. [2025-03-04 11:10:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:10:15,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:15,478 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:15,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:15,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:15,679 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:15,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2140595625, now seen corresponding path program 1 times [2025-03-04 11:10:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:15,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178053378] [2025-03-04 11:10:15,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:15,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:10:15,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:10:15,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:15,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178053378] [2025-03-04 11:10:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178053378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614796793] [2025-03-04 11:10:15,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:15,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:15,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:15,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:10:15,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:10:15,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:10:15,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:15,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:15,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:10:15,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:10:15,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614796793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:15,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-03-04 11:10:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447309975] [2025-03-04 11:10:15,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:15,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:10:15,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:15,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:10:15,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:10:15,955 INFO L87 Difference]: Start difference. First operand 299 states and 408 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:10:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:16,173 INFO L93 Difference]: Finished difference Result 346 states and 451 transitions. [2025-03-04 11:10:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:10:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 55 [2025-03-04 11:10:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:16,175 INFO L225 Difference]: With dead ends: 346 [2025-03-04 11:10:16,175 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 11:10:16,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:10:16,177 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 104 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:16,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 552 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 11:10:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 322. [2025-03-04 11:10:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 262 states have (on average 1.3931297709923665) internal successors, (365), 281 states have internal predecessors, (365), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:10:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 431 transitions. [2025-03-04 11:10:16,196 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 431 transitions. Word has length 55 [2025-03-04 11:10:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:16,197 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 431 transitions. [2025-03-04 11:10:16,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:10:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 431 transitions. [2025-03-04 11:10:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 11:10:16,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:16,197 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:16,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:16,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:10:16,402 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1253454012, now seen corresponding path program 1 times [2025-03-04 11:10:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:16,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568590361] [2025-03-04 11:10:16,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:16,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 11:10:16,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 11:10:16,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:16,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402888736] [2025-03-04 11:10:16,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:16,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:16,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:16,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:16,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:10:16,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 11:10:16,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 11:10:16,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:16,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:16,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:10:16,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:16,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:16,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568590361] [2025-03-04 11:10:16,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402888736] [2025-03-04 11:10:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402888736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:16,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:10:16,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:10:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283708535] [2025-03-04 11:10:16,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:16,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:10:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:16,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:10:16,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:16,706 INFO L87 Difference]: Start difference. First operand 322 states and 431 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 11:10:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:17,094 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2025-03-04 11:10:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:10:17,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 60 [2025-03-04 11:10:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:17,098 INFO L225 Difference]: With dead ends: 367 [2025-03-04 11:10:17,098 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 11:10:17,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:10:17,099 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 268 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:17,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 212 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:10:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 11:10:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 325. [2025-03-04 11:10:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 265 states have (on average 1.3584905660377358) internal successors, (360), 284 states have internal predecessors, (360), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:10:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 426 transitions. [2025-03-04 11:10:17,123 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 426 transitions. Word has length 60 [2025-03-04 11:10:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:17,123 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 426 transitions. [2025-03-04 11:10:17,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 11:10:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 426 transitions. [2025-03-04 11:10:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:10:17,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:17,124 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:17,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:17,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:10:17,325 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:17,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -289323777, now seen corresponding path program 1 times [2025-03-04 11:10:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:17,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696831896] [2025-03-04 11:10:17,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:17,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:10:17,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:10:17,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:17,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696831896] [2025-03-04 11:10:17,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696831896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909153714] [2025-03-04 11:10:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:17,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:17,423 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:17,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:10:17,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:10:17,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:10:17,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:17,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:17,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:10:17,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:10:17,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909153714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:17,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:17,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 12 [2025-03-04 11:10:17,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23285389] [2025-03-04 11:10:17,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:17,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:10:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:17,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:10:17,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:17,616 INFO L87 Difference]: Start difference. First operand 325 states and 426 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:10:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:17,767 INFO L93 Difference]: Finished difference Result 488 states and 640 transitions. [2025-03-04 11:10:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:10:17,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 68 [2025-03-04 11:10:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:17,769 INFO L225 Difference]: With dead ends: 488 [2025-03-04 11:10:17,769 INFO L226 Difference]: Without dead ends: 338 [2025-03-04 11:10:17,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:10:17,770 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:17,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 422 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-04 11:10:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 331. [2025-03-04 11:10:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 271 states have (on average 1.3468634686346863) internal successors, (365), 290 states have internal predecessors, (365), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:10:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 431 transitions. [2025-03-04 11:10:17,792 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 431 transitions. Word has length 68 [2025-03-04 11:10:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 431 transitions. [2025-03-04 11:10:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:10:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 431 transitions. [2025-03-04 11:10:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:10:17,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:17,793 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:10:17,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:17,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:17,994 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1125520865, now seen corresponding path program 2 times [2025-03-04 11:10:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384649572] [2025-03-04 11:10:17,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:17,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 11:10:18,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:10:18,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:18,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:18,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542942711] [2025-03-04 11:10:18,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:18,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:18,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:18,009 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:18,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:10:18,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 11:10:18,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:10:18,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:18,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:18,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:10:18,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:18,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384649572] [2025-03-04 11:10:18,125 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542942711] [2025-03-04 11:10:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542942711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:18,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:18,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 11:10:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031600638] [2025-03-04 11:10:18,126 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:18,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:18,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:18,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:18,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:18,127 INFO L87 Difference]: Start difference. First operand 331 states and 431 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:18,210 INFO L93 Difference]: Finished difference Result 480 states and 615 transitions. [2025-03-04 11:10:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:18,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2025-03-04 11:10:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:18,212 INFO L225 Difference]: With dead ends: 480 [2025-03-04 11:10:18,212 INFO L226 Difference]: Without dead ends: 476 [2025-03-04 11:10:18,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:18,213 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 117 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:18,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 224 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-04 11:10:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 362. [2025-03-04 11:10:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 298 states have (on average 1.325503355704698) internal successors, (395), 317 states have internal predecessors, (395), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 11:10:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 469 transitions. [2025-03-04 11:10:18,233 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 469 transitions. Word has length 72 [2025-03-04 11:10:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:18,233 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 469 transitions. [2025-03-04 11:10:18,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 469 transitions. [2025-03-04 11:10:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 11:10:18,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:18,234 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:18,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:18,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:18,438 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:18,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 295959034, now seen corresponding path program 1 times [2025-03-04 11:10:18,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:18,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478759624] [2025-03-04 11:10:18,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:18,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:18,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 11:10:18,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 11:10:18,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:18,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478759624] [2025-03-04 11:10:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478759624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:18,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000652967] [2025-03-04 11:10:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:18,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:10:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:18,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:10:18,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:18,485 INFO L87 Difference]: Start difference. First operand 362 states and 469 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 11:10:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:18,536 INFO L93 Difference]: Finished difference Result 362 states and 469 transitions. [2025-03-04 11:10:18,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:10:18,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 79 [2025-03-04 11:10:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:18,538 INFO L225 Difference]: With dead ends: 362 [2025-03-04 11:10:18,538 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 11:10:18,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:18,538 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:18,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 11:10:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-04 11:10:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 316 states have internal predecessors, (391), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 11:10:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2025-03-04 11:10:18,557 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 79 [2025-03-04 11:10:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:18,557 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2025-03-04 11:10:18,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 11:10:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2025-03-04 11:10:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:10:18,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:18,558 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:18,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:10:18,558 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:18,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:18,559 INFO L85 PathProgramCache]: Analyzing trace with hash 584795449, now seen corresponding path program 1 times [2025-03-04 11:10:18,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:18,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849235630] [2025-03-04 11:10:18,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:18,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:18,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:10:18,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:10:18,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:18,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849235630] [2025-03-04 11:10:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849235630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:10:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823768228] [2025-03-04 11:10:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:18,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:18,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:18,654 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:18,846 INFO L93 Difference]: Finished difference Result 561 states and 750 transitions. [2025-03-04 11:10:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:18,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-04 11:10:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:18,848 INFO L225 Difference]: With dead ends: 561 [2025-03-04 11:10:18,848 INFO L226 Difference]: Without dead ends: 560 [2025-03-04 11:10:18,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:18,850 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 125 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:18,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 222 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-04 11:10:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 499. [2025-03-04 11:10:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 422 states have (on average 1.3696682464454977) internal successors, (578), 440 states have internal predecessors, (578), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:10:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 680 transitions. [2025-03-04 11:10:18,890 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 680 transitions. Word has length 80 [2025-03-04 11:10:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:18,890 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 680 transitions. [2025-03-04 11:10:18,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 680 transitions. [2025-03-04 11:10:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 11:10:18,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:18,891 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 11:10:18,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:10:18,891 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:18,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 948789720, now seen corresponding path program 1 times [2025-03-04 11:10:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680378179] [2025-03-04 11:10:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:18,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:10:18,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:10:18,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:18,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680378179] [2025-03-04 11:10:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680378179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796214713] [2025-03-04 11:10:18,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:18,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:18,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:18,988 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:18,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:10:19,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:10:19,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:10:19,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:19,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:19,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:10:19,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:19,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:19,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796214713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:19,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 11:10:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830301967] [2025-03-04 11:10:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:19,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:19,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:19,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:19,163 INFO L87 Difference]: Start difference. First operand 499 states and 680 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 11:10:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:19,291 INFO L93 Difference]: Finished difference Result 544 states and 729 transitions. [2025-03-04 11:10:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 81 [2025-03-04 11:10:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:19,294 INFO L225 Difference]: With dead ends: 544 [2025-03-04 11:10:19,294 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 11:10:19,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:19,294 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 101 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:19,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 125 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 11:10:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 511. [2025-03-04 11:10:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 434 states have (on average 1.359447004608295) internal successors, (590), 452 states have internal predecessors, (590), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:10:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 692 transitions. [2025-03-04 11:10:19,326 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 692 transitions. Word has length 81 [2025-03-04 11:10:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:19,326 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 692 transitions. [2025-03-04 11:10:19,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 11:10:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 692 transitions. [2025-03-04 11:10:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 11:10:19,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:19,327 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 11:10:19,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:10:19,532 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,SelfDestructingSolverStorable22 [2025-03-04 11:10:19,532 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:19,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash -652289769, now seen corresponding path program 1 times [2025-03-04 11:10:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:19,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083285239] [2025-03-04 11:10:19,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:19,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 11:10:19,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:10:19,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:19,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083285239] [2025-03-04 11:10:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083285239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727967287] [2025-03-04 11:10:19,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:19,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:19,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:19,641 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:19,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:10:19,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 11:10:19,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:10:19,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:19,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:19,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:10:19,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:19,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727967287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:19,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:19,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 11:10:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455492508] [2025-03-04 11:10:19,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:19,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:19,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:10:19,782 INFO L87 Difference]: Start difference. First operand 511 states and 692 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, (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 11:10:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:19,904 INFO L93 Difference]: Finished difference Result 526 states and 705 transitions. [2025-03-04 11:10:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:10:19,904 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, (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 82 [2025-03-04 11:10:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:19,906 INFO L225 Difference]: With dead ends: 526 [2025-03-04 11:10:19,906 INFO L226 Difference]: Without dead ends: 524 [2025-03-04 11:10:19,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 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 11:10:19,906 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:19,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 119 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-04 11:10:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 515. [2025-03-04 11:10:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 438 states have (on average 1.3470319634703196) internal successors, (590), 456 states have internal predecessors, (590), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:10:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 692 transitions. [2025-03-04 11:10:19,937 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 692 transitions. Word has length 82 [2025-03-04 11:10:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:19,937 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 692 transitions. [2025-03-04 11:10:19,937 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, (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 11:10:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 692 transitions. [2025-03-04 11:10:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:10:19,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:19,938 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:19,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:20,142 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,SelfDestructingSolverStorable23 [2025-03-04 11:10:20,142 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:20,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1985215914, now seen corresponding path program 1 times [2025-03-04 11:10:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:20,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730720283] [2025-03-04 11:10:20,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:20,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:10:20,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:10:20,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:20,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:10:20,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:20,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730720283] [2025-03-04 11:10:20,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730720283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:20,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631671159] [2025-03-04 11:10:20,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:20,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:20,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:20,235 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:20,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:10:20,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:10:20,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:10:20,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:20,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:20,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:10:20,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:10:20,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:10:20,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631671159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:20,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 13 [2025-03-04 11:10:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121469547] [2025-03-04 11:10:20,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:20,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:10:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:20,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:10:20,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:10:20,452 INFO L87 Difference]: Start difference. First operand 515 states and 692 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 11:10:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:20,633 INFO L93 Difference]: Finished difference Result 551 states and 728 transitions. [2025-03-04 11:10:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:10:20,634 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 86 [2025-03-04 11:10:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:20,636 INFO L225 Difference]: With dead ends: 551 [2025-03-04 11:10:20,636 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 11:10:20,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:10:20,636 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:20,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 495 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 11:10:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2025-03-04 11:10:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 451 states have (on average 1.334811529933481) internal successors, (602), 469 states have internal predecessors, (602), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:10:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 704 transitions. [2025-03-04 11:10:20,666 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 704 transitions. Word has length 86 [2025-03-04 11:10:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:20,666 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 704 transitions. [2025-03-04 11:10:20,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 11:10:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 704 transitions. [2025-03-04 11:10:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 11:10:20,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:20,668 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:20,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:20,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:20,872 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:20,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1647431908, now seen corresponding path program 1 times [2025-03-04 11:10:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:20,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148753617] [2025-03-04 11:10:20,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:20,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:20,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:10:20,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:10:20,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:20,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672847989] [2025-03-04 11:10:20,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:20,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:20,892 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:20,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:10:20,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:10:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:10:20,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:20,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:20,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:10:20,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:21,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:21,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148753617] [2025-03-04 11:10:21,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672847989] [2025-03-04 11:10:21,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672847989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:21,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:21,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:10:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64029515] [2025-03-04 11:10:21,573 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:10:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:21,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:10:21,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:21,574 INFO L87 Difference]: Start difference. First operand 529 states and 704 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:21,907 INFO L93 Difference]: Finished difference Result 598 states and 796 transitions. [2025-03-04 11:10:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:10:21,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-04 11:10:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:21,909 INFO L225 Difference]: With dead ends: 598 [2025-03-04 11:10:21,909 INFO L226 Difference]: Without dead ends: 597 [2025-03-04 11:10:21,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:10:21,910 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 65 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:21,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 326 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:10:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-04 11:10:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 569. [2025-03-04 11:10:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 487 states have (on average 1.3305954825462012) internal successors, (648), 505 states have internal predecessors, (648), 55 states have call successors, (55), 8 states have call predecessors, (55), 8 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 11:10:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 758 transitions. [2025-03-04 11:10:21,938 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 758 transitions. Word has length 87 [2025-03-04 11:10:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 758 transitions. [2025-03-04 11:10:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 758 transitions. [2025-03-04 11:10:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 11:10:21,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:21,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:21,945 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 11:10:22,140 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,SelfDestructingSolverStorable25 [2025-03-04 11:10:22,140 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:22,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 469218417, now seen corresponding path program 1 times [2025-03-04 11:10:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321387787] [2025-03-04 11:10:22,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:22,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:10:22,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:10:22,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:22,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303832411] [2025-03-04 11:10:22,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:22,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:22,154 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:22,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:10:22,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:10:22,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:10:22,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:22,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:22,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:10:22,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:22,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:22,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:22,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321387787] [2025-03-04 11:10:22,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:22,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303832411] [2025-03-04 11:10:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303832411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:22,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:22,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:10:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085337756] [2025-03-04 11:10:22,737 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:22,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:10:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:22,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:10:22,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:22,738 INFO L87 Difference]: Start difference. First operand 569 states and 758 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:23,011 INFO L93 Difference]: Finished difference Result 625 states and 836 transitions. [2025-03-04 11:10:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:10:23,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2025-03-04 11:10:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:23,014 INFO L225 Difference]: With dead ends: 625 [2025-03-04 11:10:23,014 INFO L226 Difference]: Without dead ends: 624 [2025-03-04 11:10:23,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:10:23,014 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:23,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 322 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-04 11:10:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 609. [2025-03-04 11:10:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 523 states have (on average 1.3269598470363289) internal successors, (694), 541 states have internal predecessors, (694), 59 states have call successors, (59), 8 states have call predecessors, (59), 8 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 11:10:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 812 transitions. [2025-03-04 11:10:23,045 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 812 transitions. Word has length 88 [2025-03-04 11:10:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:23,045 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 812 transitions. [2025-03-04 11:10:23,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 812 transitions. [2025-03-04 11:10:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 11:10:23,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:23,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:23,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:23,247 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,SelfDestructingSolverStorable26 [2025-03-04 11:10:23,247 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:23,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:23,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1660869050, now seen corresponding path program 1 times [2025-03-04 11:10:23,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:23,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437009252] [2025-03-04 11:10:23,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:23,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:23,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 11:10:23,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:10:23,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:23,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437009252] [2025-03-04 11:10:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437009252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:10:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052948875] [2025-03-04 11:10:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:23,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:23,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:23,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:23,332 INFO L87 Difference]: Start difference. First operand 609 states and 812 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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 11:10:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:23,494 INFO L93 Difference]: Finished difference Result 614 states and 819 transitions. [2025-03-04 11:10:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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 89 [2025-03-04 11:10:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:23,496 INFO L225 Difference]: With dead ends: 614 [2025-03-04 11:10:23,496 INFO L226 Difference]: Without dead ends: 613 [2025-03-04 11:10:23,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:10:23,497 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:23,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 112 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-04 11:10:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 608. [2025-03-04 11:10:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 523 states have (on average 1.311663479923518) internal successors, (686), 540 states have internal predecessors, (686), 59 states have call successors, (59), 8 states have call predecessors, (59), 8 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 11:10:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 804 transitions. [2025-03-04 11:10:23,527 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 804 transitions. Word has length 89 [2025-03-04 11:10:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:23,527 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 804 transitions. [2025-03-04 11:10:23,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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 11:10:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 804 transitions. [2025-03-04 11:10:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:10:23,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:23,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:23,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 11:10:23,530 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:23,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash -52666993, now seen corresponding path program 1 times [2025-03-04 11:10:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:23,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494467932] [2025-03-04 11:10:23,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:23,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:10:23,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:10:23,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:23,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764659978] [2025-03-04 11:10:23,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:23,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:23,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:23,548 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:23,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:10:23,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:10:23,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:10:23,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:23,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:23,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:10:23,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:24,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:26,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494467932] [2025-03-04 11:10:26,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764659978] [2025-03-04 11:10:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764659978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:26,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:10:26,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 11:10:26,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199205695] [2025-03-04 11:10:26,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:26,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:10:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:26,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:10:26,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:10:26,618 INFO L87 Difference]: Start difference. First operand 608 states and 804 transitions. Second operand has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 11:10:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:31,393 INFO L93 Difference]: Finished difference Result 777 states and 1036 transitions. [2025-03-04 11:10:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 11:10:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 90 [2025-03-04 11:10:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:31,395 INFO L225 Difference]: With dead ends: 777 [2025-03-04 11:10:31,395 INFO L226 Difference]: Without dead ends: 627 [2025-03-04 11:10:31,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=376, Invalid=814, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:10:31,397 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 325 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:31,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 404 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 11:10:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-04 11:10:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 563. [2025-03-04 11:10:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 484 states have (on average 1.3243801652892562) internal successors, (641), 501 states have internal predecessors, (641), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-04 11:10:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 747 transitions. [2025-03-04 11:10:31,428 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 747 transitions. Word has length 90 [2025-03-04 11:10:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:31,428 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 747 transitions. [2025-03-04 11:10:31,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 11:10:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 747 transitions. [2025-03-04 11:10:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 11:10:31,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:31,429 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 11:10:31,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:10:31,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 11:10:31,631 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:31,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 319359492, now seen corresponding path program 3 times [2025-03-04 11:10:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:31,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317529046] [2025-03-04 11:10:31,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:10:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:31,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-03-04 11:10:31,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:10:31,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:10:31,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501500605] [2025-03-04 11:10:31,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:10:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:31,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:31,652 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:31,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:10:31,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-03-04 11:10:31,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 98 statements. [2025-03-04 11:10:31,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:10:31,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:31,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:10:31,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-04 11:10:31,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:32,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317529046] [2025-03-04 11:10:32,013 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:32,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501500605] [2025-03-04 11:10:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501500605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:32,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:32,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 11:10:32,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359047535] [2025-03-04 11:10:32,014 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:32,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:10:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:32,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:10:32,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:32,014 INFO L87 Difference]: Start difference. First operand 563 states and 747 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:10:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:32,962 INFO L93 Difference]: Finished difference Result 605 states and 784 transitions. [2025-03-04 11:10:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:10:32,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 98 [2025-03-04 11:10:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:32,964 INFO L225 Difference]: With dead ends: 605 [2025-03-04 11:10:32,964 INFO L226 Difference]: Without dead ends: 601 [2025-03-04 11:10:32,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:10:32,965 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 171 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:32,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 323 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:10:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-04 11:10:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 560. [2025-03-04 11:10:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 484 states have (on average 1.2913223140495869) internal successors, (625), 498 states have internal predecessors, (625), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-04 11:10:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 731 transitions. [2025-03-04 11:10:32,998 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 731 transitions. Word has length 98 [2025-03-04 11:10:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:32,998 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 731 transitions. [2025-03-04 11:10:32,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:10:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 731 transitions. [2025-03-04 11:10:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 11:10:32,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:32,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:33,005 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 11:10:33,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:33,199 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:33,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:33,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1461303417, now seen corresponding path program 1 times [2025-03-04 11:10:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:33,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53061062] [2025-03-04 11:10:33,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:33,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 11:10:33,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:10:33,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:33,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:33,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563040994] [2025-03-04 11:10:33,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:33,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:33,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:33,214 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 11:10:33,215 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 11:10:33,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 11:10:33,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:10:33,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:33,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:33,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:10:33,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:10:33,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:33,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53061062] [2025-03-04 11:10:33,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:33,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563040994] [2025-03-04 11:10:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563040994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:33,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:33,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:10:33,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434524768] [2025-03-04 11:10:33,806 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:33,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:10:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:33,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:10:33,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:10:33,807 INFO L87 Difference]: Start difference. First operand 560 states and 731 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:10:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:34,035 INFO L93 Difference]: Finished difference Result 565 states and 738 transitions. [2025-03-04 11:10:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:10:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 104 [2025-03-04 11:10:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:34,037 INFO L225 Difference]: With dead ends: 565 [2025-03-04 11:10:34,037 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 11:10:34,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:10:34,038 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:34,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 278 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 11:10:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2025-03-04 11:10:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 485 states have (on average 1.2907216494845362) internal successors, (626), 499 states have internal predecessors, (626), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-04 11:10:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 732 transitions. [2025-03-04 11:10:34,072 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 732 transitions. Word has length 104 [2025-03-04 11:10:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:34,072 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 732 transitions. [2025-03-04 11:10:34,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:10:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 732 transitions. [2025-03-04 11:10:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 11:10:34,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:34,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:34,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:10:34,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:34,274 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:34,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1944234350, now seen corresponding path program 1 times [2025-03-04 11:10:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374785840] [2025-03-04 11:10:34,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:34,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 11:10:34,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 11:10:34,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:34,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030412335] [2025-03-04 11:10:34,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:34,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:34,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:34,290 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 11:10:34,291 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 11:10:34,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 11:10:34,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 11:10:34,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:34,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:34,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 11:10:34,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 11:10:34,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374785840] [2025-03-04 11:10:35,770 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030412335] [2025-03-04 11:10:35,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030412335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:35,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:35,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 11:10:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692394128] [2025-03-04 11:10:35,770 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:35,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:10:35,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:35,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:10:35,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:10:35,771 INFO L87 Difference]: Start difference. First operand 561 states and 732 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 11:10:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:36,176 INFO L93 Difference]: Finished difference Result 571 states and 743 transitions. [2025-03-04 11:10:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:10:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 105 [2025-03-04 11:10:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:36,178 INFO L225 Difference]: With dead ends: 571 [2025-03-04 11:10:36,178 INFO L226 Difference]: Without dead ends: 570 [2025-03-04 11:10:36,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:10:36,180 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 30 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:36,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 432 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:10:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-04 11:10:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2025-03-04 11:10:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 486 states have (on average 1.2901234567901234) internal successors, (627), 500 states have internal predecessors, (627), 53 states have call successors, (53), 8 states have call predecessors, (53), 8 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-04 11:10:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 733 transitions. [2025-03-04 11:10:36,217 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 733 transitions. Word has length 105 [2025-03-04 11:10:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:36,217 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 733 transitions. [2025-03-04 11:10:36,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 11:10:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 733 transitions. [2025-03-04 11:10:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 11:10:36,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:36,218 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:10:36,224 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 11:10:36,421 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,SelfDestructingSolverStorable31 [2025-03-04 11:10:36,422 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1900902547, now seen corresponding path program 1 times [2025-03-04 11:10:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786106091] [2025-03-04 11:10:36,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:36,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 11:10:36,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 11:10:36,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:36,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 11:10:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786106091] [2025-03-04 11:10:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786106091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969879433] [2025-03-04 11:10:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:36,485 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 11:10:36,486 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 11:10:36,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 11:10:36,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 11:10:36,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:36,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:10:36,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 11:10:36,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 11:10:36,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969879433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:36,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 11:10:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124775371] [2025-03-04 11:10:36,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:36,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:10:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:36,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:10:36,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:10:36,698 INFO L87 Difference]: Start difference. First operand 562 states and 733 transitions. Second operand has 11 states, 10 states have (on average 10.8) internal successors, (108), 11 states have internal predecessors, (108), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 11:10:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:36,938 INFO L93 Difference]: Finished difference Result 1227 states and 1589 transitions. [2025-03-04 11:10:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:10:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 11 states have internal predecessors, (108), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 108 [2025-03-04 11:10:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:36,941 INFO L225 Difference]: With dead ends: 1227 [2025-03-04 11:10:36,941 INFO L226 Difference]: Without dead ends: 1225 [2025-03-04 11:10:36,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:10:36,942 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 541 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:36,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 406 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-04 11:10:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 649. [2025-03-04 11:10:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 557 states have (on average 1.2800718132854578) internal successors, (713), 571 states have internal predecessors, (713), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 11:10:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 851 transitions. [2025-03-04 11:10:36,985 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 851 transitions. Word has length 108 [2025-03-04 11:10:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:36,985 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 851 transitions. [2025-03-04 11:10:36,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 11 states have internal predecessors, (108), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 11:10:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 851 transitions. [2025-03-04 11:10:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:10:36,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:36,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:36,992 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 11:10:37,190 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,SelfDestructingSolverStorable32 [2025-03-04 11:10:37,190 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:37,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash -141722729, now seen corresponding path program 1 times [2025-03-04 11:10:37,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:37,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400996930] [2025-03-04 11:10:37,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:37,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:37,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:10:37,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:10:37,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:37,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 11:10:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400996930] [2025-03-04 11:10:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400996930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:10:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667019383] [2025-03-04 11:10:37,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:37,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:37,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:37,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:37,248 INFO L87 Difference]: Start difference. First operand 649 states and 851 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 11:10:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:37,367 INFO L93 Difference]: Finished difference Result 649 states and 851 transitions. [2025-03-04 11:10:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 106 [2025-03-04 11:10:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:37,369 INFO L225 Difference]: With dead ends: 649 [2025-03-04 11:10:37,369 INFO L226 Difference]: Without dead ends: 648 [2025-03-04 11:10:37,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:37,370 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 56 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:37,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 140 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-04 11:10:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2025-03-04 11:10:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 554 states have (on average 1.279783393501805) internal successors, (709), 567 states have internal predecessors, (709), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 11:10:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 847 transitions. [2025-03-04 11:10:37,411 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 847 transitions. Word has length 106 [2025-03-04 11:10:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:37,411 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 847 transitions. [2025-03-04 11:10:37,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 11:10:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 847 transitions. [2025-03-04 11:10:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:10:37,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:37,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:37,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 11:10:37,413 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:37,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash -98437328, now seen corresponding path program 1 times [2025-03-04 11:10:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:37,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722228586] [2025-03-04 11:10:37,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:37,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:10:37,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:10:37,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:37,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926318150] [2025-03-04 11:10:37,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:37,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:37,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:37,436 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 11:10:37,438 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 11:10:37,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:10:37,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:10:37,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:37,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:37,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:10:37,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 11:10:37,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722228586] [2025-03-04 11:10:49,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926318150] [2025-03-04 11:10:49,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926318150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:49,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:49,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:10:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969323501] [2025-03-04 11:10:49,900 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:49,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:49,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:49,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=63, Unknown=2, NotChecked=0, Total=90 [2025-03-04 11:10:49,900 INFO L87 Difference]: Start difference. First operand 645 states and 847 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 11:10:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:50,095 INFO L93 Difference]: Finished difference Result 739 states and 988 transitions. [2025-03-04 11:10:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 107 [2025-03-04 11:10:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:50,098 INFO L225 Difference]: With dead ends: 739 [2025-03-04 11:10:50,098 INFO L226 Difference]: Without dead ends: 730 [2025-03-04 11:10:50,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=25, Invalid=63, Unknown=2, NotChecked=0, Total=90 [2025-03-04 11:10:50,098 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:50,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 205 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-04 11:10:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 674. [2025-03-04 11:10:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 579 states have (on average 1.302245250431779) internal successors, (754), 592 states have internal predecessors, (754), 73 states have call successors, (73), 8 states have call predecessors, (73), 8 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 11:10:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 900 transitions. [2025-03-04 11:10:50,140 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 900 transitions. Word has length 107 [2025-03-04 11:10:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:50,140 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 900 transitions. [2025-03-04 11:10:50,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 11:10:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 900 transitions. [2025-03-04 11:10:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 11:10:50,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:50,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:50,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:50,342 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 11:10:50,342 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1986707460, now seen corresponding path program 1 times [2025-03-04 11:10:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780495770] [2025-03-04 11:10:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:50,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:10:50,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:10:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 11:10:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780495770] [2025-03-04 11:10:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780495770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328451256] [2025-03-04 11:10:50,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:50,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:50,498 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 11:10:50,499 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 11:10:50,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:10:50,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:10:50,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:50,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:50,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:10:50,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:10:50,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:10:50,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328451256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:50,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:50,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2025-03-04 11:10:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110681444] [2025-03-04 11:10:50,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:50,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:10:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:50,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:10:50,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:50,703 INFO L87 Difference]: Start difference. First operand 674 states and 900 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 11:10:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:51,250 INFO L93 Difference]: Finished difference Result 1157 states and 1568 transitions. [2025-03-04 11:10:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:10:51,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 110 [2025-03-04 11:10:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:51,254 INFO L225 Difference]: With dead ends: 1157 [2025-03-04 11:10:51,254 INFO L226 Difference]: Without dead ends: 991 [2025-03-04 11:10:51,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:10:51,255 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 254 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:51,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 499 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:10:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-04 11:10:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 662. [2025-03-04 11:10:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 568 states have (on average 1.3345070422535212) internal successors, (758), 581 states have internal predecessors, (758), 73 states have call successors, (73), 7 states have call predecessors, (73), 7 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 11:10:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 904 transitions. [2025-03-04 11:10:51,309 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 904 transitions. Word has length 110 [2025-03-04 11:10:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:51,309 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 904 transitions. [2025-03-04 11:10:51,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 11:10:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 904 transitions. [2025-03-04 11:10:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 11:10:51,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:51,311 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2025-03-04 11:10:51,317 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 11:10:51,511 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 11:10:51,511 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:51,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -685201257, now seen corresponding path program 2 times [2025-03-04 11:10:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:51,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521146387] [2025-03-04 11:10:51,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:51,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 11:10:51,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:10:51,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:51,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:51,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684298922] [2025-03-04 11:10:51,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:51,530 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 11:10:51,531 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 11:10:51,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 11:10:51,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:10:51,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:51,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:10:51,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 34 proven. 5 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:10:51,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521146387] [2025-03-04 11:10:52,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684298922] [2025-03-04 11:10:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684298922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:52,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:10:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491297621] [2025-03-04 11:10:52,030 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:52,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:52,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:52,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:52,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:10:52,030 INFO L87 Difference]: Start difference. First operand 662 states and 904 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 11:10:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:52,212 INFO L93 Difference]: Finished difference Result 1110 states and 1545 transitions. [2025-03-04 11:10:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:10:52,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 113 [2025-03-04 11:10:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:52,215 INFO L225 Difference]: With dead ends: 1110 [2025-03-04 11:10:52,215 INFO L226 Difference]: Without dead ends: 1104 [2025-03-04 11:10:52,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:10:52,216 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 106 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:52,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 254 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-03-04 11:10:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 765. [2025-03-04 11:10:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 661 states have (on average 1.264750378214826) internal successors, (836), 672 states have internal predecessors, (836), 85 states have call successors, (85), 7 states have call predecessors, (85), 7 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:10:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1006 transitions. [2025-03-04 11:10:52,267 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1006 transitions. Word has length 113 [2025-03-04 11:10:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:52,267 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1006 transitions. [2025-03-04 11:10:52,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 11:10:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1006 transitions. [2025-03-04 11:10:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 11:10:52,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:52,267 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 11:10:52,273 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 11:10:52,468 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 11:10:52,468 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:52,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash 233597526, now seen corresponding path program 2 times [2025-03-04 11:10:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146699461] [2025-03-04 11:10:52,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:52,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 11:10:52,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:10:52,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:52,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767143498] [2025-03-04 11:10:52,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:52,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:52,493 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 11:10:52,494 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 11:10:52,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 11:10:52,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:10:52,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:52,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:52,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:10:52,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:10:52,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:52,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146699461] [2025-03-04 11:10:52,940 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767143498] [2025-03-04 11:10:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767143498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:52,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:52,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 11:10:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488853986] [2025-03-04 11:10:52,940 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:52,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:10:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:52,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:10:52,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:10:52,941 INFO L87 Difference]: Start difference. First operand 765 states and 1006 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 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 11:10:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:53,088 INFO L93 Difference]: Finished difference Result 1000 states and 1309 transitions. [2025-03-04 11:10:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 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 114 [2025-03-04 11:10:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:53,090 INFO L225 Difference]: With dead ends: 1000 [2025-03-04 11:10:53,090 INFO L226 Difference]: Without dead ends: 845 [2025-03-04 11:10:53,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:10:53,091 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 106 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:53,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 249 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-04 11:10:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 828. [2025-03-04 11:10:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 716 states have (on average 1.2569832402234637) internal successors, (900), 727 states have internal predecessors, (900), 93 states have call successors, (93), 7 states have call predecessors, (93), 7 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-04 11:10:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1086 transitions. [2025-03-04 11:10:53,147 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1086 transitions. Word has length 114 [2025-03-04 11:10:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:53,147 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1086 transitions. [2025-03-04 11:10:53,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 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 11:10:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1086 transitions. [2025-03-04 11:10:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 11:10:53,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:53,149 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:53,155 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 11:10:53,349 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,SelfDestructingSolverStorable37 [2025-03-04 11:10:53,350 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:53,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash -651826470, now seen corresponding path program 2 times [2025-03-04 11:10:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:53,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355709909] [2025-03-04 11:10:53,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:53,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-04 11:10:53,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 133 statements. [2025-03-04 11:10:53,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:10:53,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-04 11:10:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:53,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355709909] [2025-03-04 11:10:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355709909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:53,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:10:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227933518] [2025-03-04 11:10:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:53,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:53,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:53,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:53,414 INFO L87 Difference]: Start difference. First operand 828 states and 1086 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 11:10:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:53,500 INFO L93 Difference]: Finished difference Result 829 states and 1086 transitions. [2025-03-04 11:10:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:53,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 133 [2025-03-04 11:10:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:53,503 INFO L225 Difference]: With dead ends: 829 [2025-03-04 11:10:53,503 INFO L226 Difference]: Without dead ends: 828 [2025-03-04 11:10:53,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:53,504 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 21 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:53,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 209 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-03-04 11:10:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2025-03-04 11:10:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 716 states have (on average 1.2541899441340782) internal successors, (898), 727 states have internal predecessors, (898), 93 states have call successors, (93), 7 states have call predecessors, (93), 7 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-04 11:10:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1084 transitions. [2025-03-04 11:10:53,576 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1084 transitions. Word has length 133 [2025-03-04 11:10:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:53,576 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1084 transitions. [2025-03-04 11:10:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 11:10:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1084 transitions. [2025-03-04 11:10:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 11:10:53,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:53,577 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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 11:10:53,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 11:10:53,577 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash 563493327, now seen corresponding path program 1 times [2025-03-04 11:10:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:53,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411296303] [2025-03-04 11:10:53,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:53,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:53,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 11:10:53,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 11:10:53,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:53,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:10:53,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411296303] [2025-03-04 11:10:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411296303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917047618] [2025-03-04 11:10:53,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:53,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:53,755 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 11:10:53,756 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 11:10:53,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 11:10:53,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 11:10:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:53,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:10:53,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 387 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 11:10:53,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:10:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917047618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:54,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 25 [2025-03-04 11:10:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138326621] [2025-03-04 11:10:54,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:54,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:10:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:54,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:10:54,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:10:54,085 INFO L87 Difference]: Start difference. First operand 828 states and 1084 transitions. Second operand has 26 states, 25 states have (on average 5.76) internal successors, (144), 26 states have internal predecessors, (144), 10 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2025-03-04 11:10:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:54,526 INFO L93 Difference]: Finished difference Result 1066 states and 1359 transitions. [2025-03-04 11:10:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 11:10:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.76) internal successors, (144), 26 states have internal predecessors, (144), 10 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 133 [2025-03-04 11:10:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:54,528 INFO L225 Difference]: With dead ends: 1066 [2025-03-04 11:10:54,528 INFO L226 Difference]: Without dead ends: 1061 [2025-03-04 11:10:54,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=667, Invalid=2195, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 11:10:54,529 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 259 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:54,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 645 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:54,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-04 11:10:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1019. [2025-03-04 11:10:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 888 states have (on average 1.2240990990990992) internal successors, (1087), 899 states have internal predecessors, (1087), 105 states have call successors, (105), 14 states have call predecessors, (105), 14 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:10:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1297 transitions. [2025-03-04 11:10:54,594 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1297 transitions. Word has length 133 [2025-03-04 11:10:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1297 transitions. [2025-03-04 11:10:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.76) internal successors, (144), 26 states have internal predecessors, (144), 10 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2025-03-04 11:10:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1297 transitions. [2025-03-04 11:10:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 11:10:54,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:54,595 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:54,601 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 11:10:54,796 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 11:10:54,796 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:54,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1897861553, now seen corresponding path program 1 times [2025-03-04 11:10:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:54,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661279150] [2025-03-04 11:10:54,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 11:10:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 11:10:54,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236504584] [2025-03-04 11:10:54,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:54,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:54,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:54,811 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 11:10:54,812 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 11:10:54,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 11:10:54,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 11:10:54,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:54,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:54,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:10:54,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:10:55,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:00,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661279150] [2025-03-04 11:11:00,545 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236504584] [2025-03-04 11:11:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236504584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:00,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:00,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 11:11:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533969257] [2025-03-04 11:11:00,545 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:00,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:11:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:00,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:11:00,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:11:00,547 INFO L87 Difference]: Start difference. First operand 1019 states and 1297 transitions. Second operand has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 14 states have internal predecessors, (72), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:11:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:01,115 INFO L93 Difference]: Finished difference Result 1024 states and 1303 transitions. [2025-03-04 11:11:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:11:01,116 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 14 states have internal predecessors, (72), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 139 [2025-03-04 11:11:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:01,118 INFO L225 Difference]: With dead ends: 1024 [2025-03-04 11:11:01,118 INFO L226 Difference]: Without dead ends: 1023 [2025-03-04 11:11:01,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:11:01,118 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 57 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:01,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 642 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:11:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-03-04 11:11:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1020. [2025-03-04 11:11:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 889 states have (on average 1.2238470191226096) internal successors, (1088), 900 states have internal predecessors, (1088), 105 states have call successors, (105), 14 states have call predecessors, (105), 14 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:11:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1298 transitions. [2025-03-04 11:11:01,191 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1298 transitions. Word has length 139 [2025-03-04 11:11:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:01,191 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1298 transitions. [2025-03-04 11:11:01,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 14 states have internal predecessors, (72), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:11:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1298 transitions. [2025-03-04 11:11:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 11:11:01,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:01,192 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:01,198 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 11:11:01,396 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 11:11:01,396 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:01,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1112892423, now seen corresponding path program 1 times [2025-03-04 11:11:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252752321] [2025-03-04 11:11:01,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:01,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 11:11:01,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 11:11:01,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:01,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:11:01,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252752321] [2025-03-04 11:11:01,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252752321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614921139] [2025-03-04 11:11:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:01,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:01,588 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 11:11:01,588 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 11:11:01,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 11:11:01,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 11:11:01,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:01,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:01,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:11:01,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:11:01,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:11:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614921139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:11:03,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:11:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-03-04 11:11:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998569758] [2025-03-04 11:11:03,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:03,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:11:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:03,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:11:03,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:11:03,098 INFO L87 Difference]: Start difference. First operand 1020 states and 1298 transitions. Second operand has 22 states, 21 states have (on average 10.285714285714286) internal successors, (216), 22 states have internal predecessors, (216), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2025-03-04 11:11:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:04,094 INFO L93 Difference]: Finished difference Result 1571 states and 2015 transitions. [2025-03-04 11:11:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:11:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.285714285714286) internal successors, (216), 22 states have internal predecessors, (216), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 138 [2025-03-04 11:11:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:04,098 INFO L225 Difference]: With dead ends: 1571 [2025-03-04 11:11:04,098 INFO L226 Difference]: Without dead ends: 1569 [2025-03-04 11:11:04,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:11:04,099 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 571 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:04,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 940 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:11:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-03-04 11:11:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1356. [2025-03-04 11:11:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1197 states have (on average 1.2247284878863827) internal successors, (1466), 1208 states have internal predecessors, (1466), 133 states have call successors, (133), 14 states have call predecessors, (133), 14 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-04 11:11:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1732 transitions. [2025-03-04 11:11:04,193 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1732 transitions. Word has length 138 [2025-03-04 11:11:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:04,193 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1732 transitions. [2025-03-04 11:11:04,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.285714285714286) internal successors, (216), 22 states have internal predecessors, (216), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2025-03-04 11:11:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1732 transitions. [2025-03-04 11:11:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 11:11:04,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:04,194 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:04,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 11:11:04,394 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 11:11:04,394 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:04,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1295833980, now seen corresponding path program 1 times [2025-03-04 11:11:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344197373] [2025-03-04 11:11:04,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:04,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 11:11:04,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 11:11:04,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:04,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:04,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461413559] [2025-03-04 11:11:04,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:04,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:04,414 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 11:11:04,416 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 11:11:04,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 11:11:04,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 11:11:04,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:04,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:04,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:11:04,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:11:05,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:06,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344197373] [2025-03-04 11:11:06,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461413559] [2025-03-04 11:11:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461413559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:06,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:06,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 11:11:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990929109] [2025-03-04 11:11:06,448 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:06,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:11:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:06,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:11:06,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:11:06,449 INFO L87 Difference]: Start difference. First operand 1356 states and 1732 transitions. Second operand has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 14 states have internal predecessors, (73), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:11:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:07,163 INFO L93 Difference]: Finished difference Result 1361 states and 1736 transitions. [2025-03-04 11:11:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:11:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 14 states have internal predecessors, (73), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 140 [2025-03-04 11:11:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:07,167 INFO L225 Difference]: With dead ends: 1361 [2025-03-04 11:11:07,168 INFO L226 Difference]: Without dead ends: 1359 [2025-03-04 11:11:07,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:11:07,168 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:07,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 706 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:11:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-03-04 11:11:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1357. [2025-03-04 11:11:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1198 states have (on average 1.2237061769616027) internal successors, (1466), 1209 states have internal predecessors, (1466), 133 states have call successors, (133), 14 states have call predecessors, (133), 14 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-04 11:11:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1732 transitions. [2025-03-04 11:11:07,263 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1732 transitions. Word has length 140 [2025-03-04 11:11:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:07,263 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1732 transitions. [2025-03-04 11:11:07,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 14 states have internal predecessors, (73), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 11:11:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1732 transitions. [2025-03-04 11:11:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 11:11:07,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:07,264 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:07,270 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 11:11:07,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:07,464 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash 201002244, now seen corresponding path program 1 times [2025-03-04 11:11:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631078182] [2025-03-04 11:11:07,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:07,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 11:11:07,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 11:11:07,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:07,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325933094] [2025-03-04 11:11:07,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:07,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:07,482 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 11:11:07,484 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 11:11:07,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 11:11:07,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 11:11:07,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:07,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:07,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 11:11:07,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:11:08,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:11,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631078182] [2025-03-04 11:11:11,578 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325933094] [2025-03-04 11:11:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325933094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:11,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-04 11:11:11,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482433011] [2025-03-04 11:11:11,578 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:11,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:11:11,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:11,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:11:11,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:11:11,579 INFO L87 Difference]: Start difference. First operand 1357 states and 1732 transitions. Second operand has 15 states, 14 states have (on average 5.5) internal successors, (77), 15 states have internal predecessors, (77), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:11:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:12,105 INFO L93 Difference]: Finished difference Result 1385 states and 1756 transitions. [2025-03-04 11:11:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:11:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 15 states have internal predecessors, (77), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 139 [2025-03-04 11:11:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:12,108 INFO L225 Difference]: With dead ends: 1385 [2025-03-04 11:11:12,108 INFO L226 Difference]: Without dead ends: 1219 [2025-03-04 11:11:12,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:11:12,109 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:12,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 589 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:11:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-04 11:11:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1216. [2025-03-04 11:11:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1069 states have (on average 1.225444340505145) internal successors, (1310), 1080 states have internal predecessors, (1310), 121 states have call successors, (121), 14 states have call predecessors, (121), 14 states have return successors, (121), 121 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-04 11:11:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1552 transitions. [2025-03-04 11:11:12,206 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1552 transitions. Word has length 139 [2025-03-04 11:11:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:12,206 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1552 transitions. [2025-03-04 11:11:12,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 15 states have internal predecessors, (77), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:11:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1552 transitions. [2025-03-04 11:11:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 11:11:12,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:12,207 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:12,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-04 11:11:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-03-04 11:11:12,411 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:12,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1936102247, now seen corresponding path program 1 times [2025-03-04 11:11:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:12,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215380522] [2025-03-04 11:11:12,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:12,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 11:11:12,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 11:11:12,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:12,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:12,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277073314] [2025-03-04 11:11:12,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:12,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:12,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:12,439 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:12,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 11:11:12,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 11:11:12,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 11:11:12,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:12,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:12,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 11:11:12,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:11:13,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:15,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:15,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215380522] [2025-03-04 11:11:15,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:15,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277073314] [2025-03-04 11:11:15,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277073314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:15,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-04 11:11:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673962013] [2025-03-04 11:11:15,353 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:15,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:11:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:15,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:11:15,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:11:15,354 INFO L87 Difference]: Start difference. First operand 1216 states and 1552 transitions. Second operand has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 15 states have internal predecessors, (78), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:11:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:15,730 INFO L93 Difference]: Finished difference Result 1221 states and 1556 transitions. [2025-03-04 11:11:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:11:15,731 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 15 states have internal predecessors, (78), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 140 [2025-03-04 11:11:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:15,734 INFO L225 Difference]: With dead ends: 1221 [2025-03-04 11:11:15,734 INFO L226 Difference]: Without dead ends: 1215 [2025-03-04 11:11:15,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:11:15,734 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 24 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:15,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 476 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:11:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-04 11:11:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2025-03-04 11:11:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1068 states have (on average 1.2237827715355805) internal successors, (1307), 1079 states have internal predecessors, (1307), 121 states have call successors, (121), 14 states have call predecessors, (121), 14 states have return successors, (121), 121 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-04 11:11:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1549 transitions. [2025-03-04 11:11:15,819 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1549 transitions. Word has length 140 [2025-03-04 11:11:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:15,819 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1549 transitions. [2025-03-04 11:11:15,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 15 states have internal predecessors, (78), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 11:11:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1549 transitions. [2025-03-04 11:11:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 11:11:15,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:15,820 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:15,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-04 11:11:16,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:16,020 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:16,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash -244061798, now seen corresponding path program 1 times [2025-03-04 11:11:16,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:16,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610014] [2025-03-04 11:11:16,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:16,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 11:11:16,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 11:11:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:16,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357585342] [2025-03-04 11:11:16,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:16,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:16,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:16,044 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:16,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 11:11:16,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 11:11:16,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 11:11:16,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:16,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:16,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 11:11:16,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:11:17,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:11:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610014] [2025-03-04 11:11:21,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357585342] [2025-03-04 11:11:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357585342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:11:21,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:11:21,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2025-03-04 11:11:21,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630319883] [2025-03-04 11:11:21,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:21,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 11:11:21,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:21,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 11:11:21,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:11:21,428 INFO L87 Difference]: Start difference. First operand 1215 states and 1549 transitions. Second operand has 28 states, 27 states have (on average 5.333333333333333) internal successors, (144), 28 states have internal predecessors, (144), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-04 11:11:37,507 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 83 DAG size of output: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)