./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/bresenham-ll_unwindbound1.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 f5dead2b097a3e2aa15cd919ca1c3a66944ae841df5c6a1b5b64a326ca5f0b4a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:03:46,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:03:46,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:03:46,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:03:46,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:03:46,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:03:46,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:03:46,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:03:46,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:03:46,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:03:46,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:03:46,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:03:46,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:03:46,161 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:03:46,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:03:46,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:03:46,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:03:46,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:03:46,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:03:46,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:03:46,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:03:46,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:03:46,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:03:46,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:03:46,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:03:46,164 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 -> f5dead2b097a3e2aa15cd919ca1c3a66944ae841df5c6a1b5b64a326ca5f0b4a [2025-03-09 02:03:46,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:03:46,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:03:46,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:03:46,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:03:46,387 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:03:46,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound1.c [2025-03-09 02:03:47,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9ad70a5/06f34f98e6eb428592c503a1b647a78d/FLAG09c579399 [2025-03-09 02:03:47,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:03:47,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound1.c [2025-03-09 02:03:47,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9ad70a5/06f34f98e6eb428592c503a1b647a78d/FLAG09c579399 [2025-03-09 02:03:47,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9ad70a5/06f34f98e6eb428592c503a1b647a78d [2025-03-09 02:03:47,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:03:47,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:03:47,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:03:47,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:03:47,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:03:47,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41446da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47, skipping insertion in model container [2025-03-09 02:03:47,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:03:47,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:03:47,895 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:03:47,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:03:47,924 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:03:47,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47 WrapperNode [2025-03-09 02:03:47,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:03:47,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:03:47,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:03:47,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:03:47,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,952 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2025-03-09 02:03:47,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:03:47,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:03:47,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:03:47,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:03:47,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,973 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-09 02:03:47,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:03:47,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:03:47,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:03:47,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:03:47,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (1/1) ... [2025-03-09 02:03:47,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:03:48,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:48,016 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-09 02:03:48,021 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-09 02:03:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:03:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:03:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:03:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:03:48,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:03:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:03:48,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:03:48,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:03:48,396 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-09 02:03:48,396 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:03:48,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:03:48,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:03:48,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:03:48 BoogieIcfgContainer [2025-03-09 02:03:48,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:03:48,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:03:48,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:03:48,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:03:48,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:03:47" (1/3) ... [2025-03-09 02:03:48,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8010a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:03:48, skipping insertion in model container [2025-03-09 02:03:48,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:03:47" (2/3) ... [2025-03-09 02:03:48,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8010a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:03:48, skipping insertion in model container [2025-03-09 02:03:48,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:03:48" (3/3) ... [2025-03-09 02:03:48,418 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound1.c [2025-03-09 02:03:48,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:03:48,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound1.c that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 60 error locations. [2025-03-09 02:03:48,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:03:48,478 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;@7e9d6523, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:03:48,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-09 02:03:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 135 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:03:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 02:03:48,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:48,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 02:03:48,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:48,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash 163813, now seen corresponding path program 1 times [2025-03-09 02:03:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:48,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804385161] [2025-03-09 02:03:48,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:48,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 02:03:48,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 02:03:48,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:48,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:48,595 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-09 02:03:48,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:48,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804385161] [2025-03-09 02:03:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804385161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:48,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:48,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:03:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068462499] [2025-03-09 02:03:48,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:48,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:03:48,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:48,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:03:48,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:03:48,617 INFO L87 Difference]: Start difference. First operand has 139 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 135 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 02:03:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:48,757 INFO L93 Difference]: Finished difference Result 264 states and 279 transitions. [2025-03-09 02:03:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:03:48,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-09 02:03:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:48,764 INFO L225 Difference]: With dead ends: 264 [2025-03-09 02:03:48,764 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 02:03:48,767 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-09 02:03:48,769 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 97 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:48,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 85 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 02:03:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-09 02:03:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8285714285714285) internal successors, (128), 125 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2025-03-09 02:03:48,799 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2025-03-09 02:03:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2025-03-09 02:03:48,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 02:03:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2025-03-09 02:03:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 02:03:48,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:48,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 02:03:48,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:03:48,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:48,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:48,801 INFO L85 PathProgramCache]: Analyzing trace with hash 5078303, now seen corresponding path program 1 times [2025-03-09 02:03:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:48,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161596243] [2025-03-09 02:03:48,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:48,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:48,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 02:03:48,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 02:03:48,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:48,835 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-09 02:03:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161596243] [2025-03-09 02:03:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161596243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:48,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:48,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:03:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041801658] [2025-03-09 02:03:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:03:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:48,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:03:48,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:03:48,838 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-09 02:03:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:48,928 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2025-03-09 02:03:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:03:48,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-09 02:03:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:48,932 INFO L225 Difference]: With dead ends: 128 [2025-03-09 02:03:48,932 INFO L226 Difference]: Without dead ends: 124 [2025-03-09 02:03:48,933 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-09 02:03:48,933 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 76 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-09 02:03:48,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-09 02:03:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-09 02:03:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 121 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2025-03-09 02:03:48,941 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 4 [2025-03-09 02:03:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:48,941 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2025-03-09 02:03:48,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-09 02:03:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2025-03-09 02:03:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 02:03:48,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:48,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 02:03:48,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:03:48,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 157427491, now seen corresponding path program 1 times [2025-03-09 02:03:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:48,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802073417] [2025-03-09 02:03:48,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:48,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 02:03:48,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 02:03:48,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:48,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:48,979 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-09 02:03:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802073417] [2025-03-09 02:03:48,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802073417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:48,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:48,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:03:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588094954] [2025-03-09 02:03:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:48,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:03:48,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:48,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:03:48,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:03:48,980 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:49,089 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2025-03-09 02:03:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:03:49,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 02:03:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:49,091 INFO L225 Difference]: With dead ends: 124 [2025-03-09 02:03:49,091 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 02:03:49,091 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-09 02:03:49,091 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:49,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 62 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 02:03:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-09 02:03:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 120 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2025-03-09 02:03:49,096 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 5 [2025-03-09 02:03:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:49,097 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2025-03-09 02:03:49,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2025-03-09 02:03:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:03:49,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:49,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:03:49,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:03:49,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:49,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash 585285021, now seen corresponding path program 1 times [2025-03-09 02:03:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:49,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794056067] [2025-03-09 02:03:49,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:49,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:03:49,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:03:49,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:49,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:49,132 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-09 02:03:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794056067] [2025-03-09 02:03:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794056067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:49,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:03:49,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274197864] [2025-03-09 02:03:49,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:49,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:03:49,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:49,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:03:49,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:03:49,134 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand has 3 states, 2 states have (on average 3.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-09 02:03:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:49,236 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2025-03-09 02:03:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:03:49,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-09 02:03:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:49,237 INFO L225 Difference]: With dead ends: 123 [2025-03-09 02:03:49,237 INFO L226 Difference]: Without dead ends: 122 [2025-03-09 02:03:49,237 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-09 02:03:49,238 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:49,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 62 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-09 02:03:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-09 02:03:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 70 states have (on average 1.7428571428571429) internal successors, (122), 119 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2025-03-09 02:03:49,243 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 6 [2025-03-09 02:03:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:49,243 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2025-03-09 02:03:49,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-09 02:03:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2025-03-09 02:03:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:03:49,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:49,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:49,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:03:49,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:49,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -181807589, now seen corresponding path program 1 times [2025-03-09 02:03:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:49,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294245341] [2025-03-09 02:03:49,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:49,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:49,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:03:49,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:03:49,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:49,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:49,303 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-09 02:03:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294245341] [2025-03-09 02:03:49,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294245341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:49,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:49,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:03:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529550976] [2025-03-09 02:03:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:49,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:49,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:49,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:49,305 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-09 02:03:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:49,330 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2025-03-09 02:03:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:03:49,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-09 02:03:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:49,331 INFO L225 Difference]: With dead ends: 170 [2025-03-09 02:03:49,331 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 02:03:49,331 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-09 02:03:49,333 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:49,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 351 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:03:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 02:03:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-09 02:03:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 123 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2025-03-09 02:03:49,343 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 8 [2025-03-09 02:03:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:49,343 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2025-03-09 02:03:49,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-09 02:03:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2025-03-09 02:03:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 02:03:49,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:49,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:49,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:03:49,345 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:49,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash -276034339, now seen corresponding path program 1 times [2025-03-09 02:03:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051387381] [2025-03-09 02:03:49,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:49,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 02:03:49,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 02:03:49,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:49,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514478845] [2025-03-09 02:03:49,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:49,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:49,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:49,363 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-09 02:03:49,364 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-09 02:03:49,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 02:03:49,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 02:03:49,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:49,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:49,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:03:49,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:49,404 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-09 02:03:49,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051387381] [2025-03-09 02:03:49,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514478845] [2025-03-09 02:03:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514478845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:49,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:03:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664775138] [2025-03-09 02:03:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:49,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:03:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:49,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:03:49,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:03:49,406 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-09 02:03:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:49,474 INFO L93 Difference]: Finished difference Result 194 states and 199 transitions. [2025-03-09 02:03:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:03:49,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-03-09 02:03:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:49,476 INFO L225 Difference]: With dead ends: 194 [2025-03-09 02:03:49,477 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 02:03:49,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-09 02:03:49,477 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:49,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 221 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 02:03:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 150. [2025-03-09 02:03:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 97 states have (on average 1.690721649484536) internal successors, (164), 146 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:03:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2025-03-09 02:03:49,488 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 11 [2025-03-09 02:03:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:49,488 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2025-03-09 02:03:49,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-09 02:03:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2025-03-09 02:03:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:03:49,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:49,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:49,495 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-09 02:03:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:03:49,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:49,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1018975259, now seen corresponding path program 1 times [2025-03-09 02:03:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:49,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675403259] [2025-03-09 02:03:49,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:49,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:03:49,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:03:49,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:49,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936351622] [2025-03-09 02:03:49,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:49,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:49,704 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-09 02:03:49,705 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-09 02:03:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:03:49,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:03:49,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:49,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:49,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:03:49,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:49,748 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-09 02:03:49,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675403259] [2025-03-09 02:03:49,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936351622] [2025-03-09 02:03:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936351622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:49,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:03:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98376655] [2025-03-09 02:03:49,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:49,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:03:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:49,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:03:49,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:03:49,750 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-09 02:03:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:49,789 INFO L93 Difference]: Finished difference Result 256 states and 279 transitions. [2025-03-09 02:03:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:03:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-03-09 02:03:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:49,790 INFO L225 Difference]: With dead ends: 256 [2025-03-09 02:03:49,790 INFO L226 Difference]: Without dead ends: 250 [2025-03-09 02:03:49,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-09 02:03:49,791 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 94 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:49,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 219 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:03:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-09 02:03:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 202. [2025-03-09 02:03:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 148 states have (on average 1.6891891891891893) internal successors, (250), 197 states have internal predecessors, (250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 256 transitions. [2025-03-09 02:03:49,803 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 256 transitions. Word has length 13 [2025-03-09 02:03:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 256 transitions. [2025-03-09 02:03:49,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-09 02:03:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 256 transitions. [2025-03-09 02:03:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:03:49,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:49,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:49,810 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-09 02:03:50,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 02:03:50,007 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:50,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash -17317031, now seen corresponding path program 1 times [2025-03-09 02:03:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380494301] [2025-03-09 02:03:50,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:50,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:03:50,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:03:50,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:50,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552021314] [2025-03-09 02:03:50,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:50,017 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-09 02:03:50,018 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-09 02:03:50,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:03:50,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:03:50,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:50,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:50,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:03:50,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:50,074 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-09 02:03:50,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:50,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380494301] [2025-03-09 02:03:50,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552021314] [2025-03-09 02:03:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552021314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:50,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203001347] [2025-03-09 02:03:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:50,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:50,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:50,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:50,076 INFO L87 Difference]: Start difference. First operand 202 states and 256 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:50,204 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2025-03-09 02:03:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:03:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 02:03:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:50,206 INFO L225 Difference]: With dead ends: 294 [2025-03-09 02:03:50,206 INFO L226 Difference]: Without dead ends: 292 [2025-03-09 02:03:50,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09 02:03:50,207 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 143 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:50,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 241 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-09 02:03:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 203. [2025-03-09 02:03:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 149 states have (on average 1.6778523489932886) internal successors, (250), 198 states have internal predecessors, (250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2025-03-09 02:03:50,217 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 15 [2025-03-09 02:03:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2025-03-09 02:03:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2025-03-09 02:03:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:03:50,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:50,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:50,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:03:50,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:50,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:50,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash -536827885, now seen corresponding path program 1 times [2025-03-09 02:03:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476464398] [2025-03-09 02:03:50,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:50,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:03:50,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:03:50,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:50,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138302557] [2025-03-09 02:03:50,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:50,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:50,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:50,429 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-09 02:03:50,431 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-09 02:03:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:03:50,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:03:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:50,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:50,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:03:50,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:50,484 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-09 02:03:50,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:50,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476464398] [2025-03-09 02:03:50,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138302557] [2025-03-09 02:03:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138302557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:50,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:50,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:50,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786737911] [2025-03-09 02:03:50,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:50,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:50,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:50,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:50,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:50,486 INFO L87 Difference]: Start difference. First operand 203 states and 256 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-09 02:03:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:50,648 INFO L93 Difference]: Finished difference Result 293 states and 355 transitions. [2025-03-09 02:03:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:03:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-03-09 02:03:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:50,650 INFO L225 Difference]: With dead ends: 293 [2025-03-09 02:03:50,650 INFO L226 Difference]: Without dead ends: 291 [2025-03-09 02:03:50,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-09 02:03:50,650 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 141 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:50,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 244 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-09 02:03:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 204. [2025-03-09 02:03:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 150 states have (on average 1.6666666666666667) internal successors, (250), 199 states have internal predecessors, (250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2025-03-09 02:03:50,659 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 16 [2025-03-09 02:03:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:50,659 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2025-03-09 02:03:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-09 02:03:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2025-03-09 02:03:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 02:03:50,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:50,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:50,666 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-09 02:03:50,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:50,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:50,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 538204823, now seen corresponding path program 1 times [2025-03-09 02:03:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292863065] [2025-03-09 02:03:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:50,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:03:50,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:03:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:50,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138633482] [2025-03-09 02:03:50,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:50,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:50,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:50,869 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-09 02:03:50,871 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-09 02:03:50,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:03:50,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:03:50,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:50,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:50,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:03:50,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:50,916 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-09 02:03:50,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292863065] [2025-03-09 02:03:50,916 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138633482] [2025-03-09 02:03:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138633482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493741793] [2025-03-09 02:03:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:50,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:50,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:50,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:50,917 INFO L87 Difference]: Start difference. First operand 204 states and 256 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:51,018 INFO L93 Difference]: Finished difference Result 279 states and 299 transitions. [2025-03-09 02:03:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:03:51,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 02:03:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:51,020 INFO L225 Difference]: With dead ends: 279 [2025-03-09 02:03:51,020 INFO L226 Difference]: Without dead ends: 277 [2025-03-09 02:03:51,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-09 02:03:51,021 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 194 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:51,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 264 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-09 02:03:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 204. [2025-03-09 02:03:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 150 states have (on average 1.6466666666666667) internal successors, (247), 199 states have internal predecessors, (247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2025-03-09 02:03:51,028 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 17 [2025-03-09 02:03:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:51,029 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2025-03-09 02:03:51,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2025-03-09 02:03:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:03:51,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:51,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:51,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:03:51,230 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,SelfDestructingSolverStorable9 [2025-03-09 02:03:51,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:51,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash -495519599, now seen corresponding path program 1 times [2025-03-09 02:03:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883493740] [2025-03-09 02:03:51,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:51,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:51,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:03:51,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:03:51,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:51,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884978854] [2025-03-09 02:03:51,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:51,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:51,244 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-09 02:03:51,245 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-09 02:03:51,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:03:51,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:03:51,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:51,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:03:51,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:51,295 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-09 02:03:51,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883493740] [2025-03-09 02:03:51,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884978854] [2025-03-09 02:03:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884978854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919242412] [2025-03-09 02:03:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:51,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:51,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:51,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:51,296 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 02:03:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:51,400 INFO L93 Difference]: Finished difference Result 277 states and 296 transitions. [2025-03-09 02:03:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:03:51,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2025-03-09 02:03:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:51,401 INFO L225 Difference]: With dead ends: 277 [2025-03-09 02:03:51,401 INFO L226 Difference]: Without dead ends: 275 [2025-03-09 02:03:51,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-09 02:03:51,402 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 191 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:51,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 266 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-09 02:03:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 204. [2025-03-09 02:03:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 150 states have (on average 1.6266666666666667) internal successors, (244), 199 states have internal predecessors, (244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 250 transitions. [2025-03-09 02:03:51,409 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 250 transitions. Word has length 18 [2025-03-09 02:03:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:51,409 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 250 transitions. [2025-03-09 02:03:51,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 02:03:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 250 transitions. [2025-03-09 02:03:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 02:03:51,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:51,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:51,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:03:51,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:51,614 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1818761685, now seen corresponding path program 1 times [2025-03-09 02:03:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512807080] [2025-03-09 02:03:51,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:51,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:03:51,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:03:51,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:51,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494663272] [2025-03-09 02:03:51,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:51,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:51,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:51,631 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-09 02:03:51,632 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-09 02:03:51,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:03:51,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:03:51,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:51,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:51,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:03:51,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:51,724 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-09 02:03:51,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512807080] [2025-03-09 02:03:51,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494663272] [2025-03-09 02:03:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494663272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:03:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211872221] [2025-03-09 02:03:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:51,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:03:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:51,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:03:51,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:03:51,725 INFO L87 Difference]: Start difference. First operand 204 states and 250 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-09 02:03:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:51,926 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2025-03-09 02:03:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:03:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-03-09 02:03:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:51,927 INFO L225 Difference]: With dead ends: 292 [2025-03-09 02:03:51,927 INFO L226 Difference]: Without dead ends: 290 [2025-03-09 02:03:51,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-09 02:03:51,928 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 216 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:51,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 282 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-09 02:03:51,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 207. [2025-03-09 02:03:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.607843137254902) internal successors, (246), 202 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 252 transitions. [2025-03-09 02:03:51,934 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 252 transitions. Word has length 19 [2025-03-09 02:03:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:51,935 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 252 transitions. [2025-03-09 02:03:51,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-09 02:03:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 252 transitions. [2025-03-09 02:03:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:03:51,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:51,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:51,942 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-09 02:03:52,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:52,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:52,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 547037455, now seen corresponding path program 1 times [2025-03-09 02:03:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:52,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150069139] [2025-03-09 02:03:52,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:52,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:52,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:03:52,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:03:52,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:52,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037771467] [2025-03-09 02:03:52,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:52,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:52,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:52,152 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-09 02:03:52,153 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-09 02:03:52,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:03:52,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:03:52,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:52,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:52,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:03:52,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:52,228 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-09 02:03:52,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150069139] [2025-03-09 02:03:52,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037771467] [2025-03-09 02:03:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037771467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:03:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062185238] [2025-03-09 02:03:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:52,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:03:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:52,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:03:52,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:03:52,230 INFO L87 Difference]: Start difference. First operand 207 states and 252 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-09 02:03:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:52,411 INFO L93 Difference]: Finished difference Result 291 states and 339 transitions. [2025-03-09 02:03:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:03:52,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2025-03-09 02:03:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:52,412 INFO L225 Difference]: With dead ends: 291 [2025-03-09 02:03:52,412 INFO L226 Difference]: Without dead ends: 289 [2025-03-09 02:03:52,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-09 02:03:52,412 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 214 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:52,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 285 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-09 02:03:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 208. [2025-03-09 02:03:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 154 states have (on average 1.5974025974025974) internal successors, (246), 203 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 252 transitions. [2025-03-09 02:03:52,418 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 252 transitions. Word has length 20 [2025-03-09 02:03:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:52,418 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 252 transitions. [2025-03-09 02:03:52,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-09 02:03:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 252 transitions. [2025-03-09 02:03:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 02:03:52,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:52,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:52,424 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-09 02:03:52,621 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,SelfDestructingSolverStorable12 [2025-03-09 02:03:52,621 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:52,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:52,621 INFO L85 PathProgramCache]: Analyzing trace with hash -221708013, now seen corresponding path program 1 times [2025-03-09 02:03:52,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:52,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803018015] [2025-03-09 02:03:52,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:52,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:52,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:03:52,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:03:52,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:52,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:52,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058080018] [2025-03-09 02:03:52,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:52,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:52,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:52,633 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-09 02:03:52,634 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-09 02:03:52,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:03:52,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:03:52,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:52,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:52,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:03:52,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:52,752 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-09 02:03:52,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:52,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803018015] [2025-03-09 02:03:52,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058080018] [2025-03-09 02:03:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058080018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:52,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:03:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540529930] [2025-03-09 02:03:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:52,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:03:52,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:52,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:03:52,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:03:52,753 INFO L87 Difference]: Start difference. First operand 208 states and 252 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-09 02:03:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:52,991 INFO L93 Difference]: Finished difference Result 279 states and 337 transitions. [2025-03-09 02:03:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:03:52,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2025-03-09 02:03:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:52,992 INFO L225 Difference]: With dead ends: 279 [2025-03-09 02:03:52,993 INFO L226 Difference]: Without dead ends: 277 [2025-03-09 02:03:52,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:03:52,993 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 284 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:52,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 216 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-09 02:03:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 209. [2025-03-09 02:03:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 155 states have (on average 1.5870967741935484) internal successors, (246), 204 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-03-09 02:03:52,998 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 21 [2025-03-09 02:03:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:52,999 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-03-09 02:03:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-09 02:03:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-03-09 02:03:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:03:52,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:52,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:53,005 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-09 02:03:53,199 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,SelfDestructingSolverStorable13 [2025-03-09 02:03:53,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:53,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1716986253, now seen corresponding path program 1 times [2025-03-09 02:03:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809386978] [2025-03-09 02:03:53,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:53,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:03:53,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:03:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058002293] [2025-03-09 02:03:53,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:53,211 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-09 02:03:53,212 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-09 02:03:53,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:03:53,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:03:53,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:53,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:53,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:03:53,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:53,328 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-09 02:03:53,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809386978] [2025-03-09 02:03:53,328 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058002293] [2025-03-09 02:03:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058002293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:53,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:03:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848162820] [2025-03-09 02:03:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:53,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:03:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:53,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:03:53,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:03:53,329 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-09 02:03:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:53,551 INFO L93 Difference]: Finished difference Result 279 states and 335 transitions. [2025-03-09 02:03:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:03:53,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2025-03-09 02:03:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:53,552 INFO L225 Difference]: With dead ends: 279 [2025-03-09 02:03:53,552 INFO L226 Difference]: Without dead ends: 277 [2025-03-09 02:03:53,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:03:53,553 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 369 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:53,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 201 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-09 02:03:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 210. [2025-03-09 02:03:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 156 states have (on average 1.5769230769230769) internal successors, (246), 205 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2025-03-09 02:03:53,559 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 22 [2025-03-09 02:03:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:53,559 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2025-03-09 02:03:53,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-09 02:03:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2025-03-09 02:03:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:03:53,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:53,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:53,566 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-09 02:03:53,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:03:53,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:53,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1971996559, now seen corresponding path program 1 times [2025-03-09 02:03:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373025032] [2025-03-09 02:03:53,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:53,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:03:53,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:03:53,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:53,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:53,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318593764] [2025-03-09 02:03:53,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:53,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:53,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:53,780 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-09 02:03:53,782 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-09 02:03:53,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:03:53,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:03:53,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:53,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:53,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:03:53,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:53,946 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-09 02:03:53,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:53,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373025032] [2025-03-09 02:03:53,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318593764] [2025-03-09 02:03:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318593764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:53,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:53,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:03:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315036749] [2025-03-09 02:03:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:53,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:03:53,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:53,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:03:53,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:03:53,950 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-09 02:03:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:54,232 INFO L93 Difference]: Finished difference Result 271 states and 333 transitions. [2025-03-09 02:03:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:03:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-09 02:03:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:54,234 INFO L225 Difference]: With dead ends: 271 [2025-03-09 02:03:54,234 INFO L226 Difference]: Without dead ends: 267 [2025-03-09 02:03:54,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:03:54,234 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 279 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:54,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 146 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-09 02:03:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 211. [2025-03-09 02:03:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 159 states have (on average 1.5471698113207548) internal successors, (246), 206 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 252 transitions. [2025-03-09 02:03:54,240 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 252 transitions. Word has length 25 [2025-03-09 02:03:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:54,240 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 252 transitions. [2025-03-09 02:03:54,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-09 02:03:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 252 transitions. [2025-03-09 02:03:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:03:54,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:54,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:54,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:03:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 02:03:54,441 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:54,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1002351241, now seen corresponding path program 1 times [2025-03-09 02:03:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801627220] [2025-03-09 02:03:54,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:54,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:03:54,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:03:54,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:54,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528942153] [2025-03-09 02:03:54,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:54,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:54,450 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-09 02:03:54,452 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-09 02:03:54,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:03:54,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:03:54,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:54,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:54,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:03:54,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:54,615 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-09 02:03:54,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801627220] [2025-03-09 02:03:54,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528942153] [2025-03-09 02:03:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528942153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:03:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12686648] [2025-03-09 02:03:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:03:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:03:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:03:54,617 INFO L87 Difference]: Start difference. First operand 211 states and 252 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:54,874 INFO L93 Difference]: Finished difference Result 269 states and 327 transitions. [2025-03-09 02:03:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:03:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-09 02:03:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:54,876 INFO L225 Difference]: With dead ends: 269 [2025-03-09 02:03:54,876 INFO L226 Difference]: Without dead ends: 265 [2025-03-09 02:03:54,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:03:54,876 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 257 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:54,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 151 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-09 02:03:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 210. [2025-03-09 02:03:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.525) internal successors, (244), 205 states have internal predecessors, (244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2025-03-09 02:03:54,891 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 26 [2025-03-09 02:03:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:54,891 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2025-03-09 02:03:54,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2025-03-09 02:03:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:03:54,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:54,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:54,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:03:55,096 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,SelfDestructingSolverStorable16 [2025-03-09 02:03:55,096 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:55,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1008117453, now seen corresponding path program 1 times [2025-03-09 02:03:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:55,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404473702] [2025-03-09 02:03:55,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:55,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:03:55,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:03:55,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:55,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:55,143 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-09 02:03:55,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:55,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404473702] [2025-03-09 02:03:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404473702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046844821] [2025-03-09 02:03:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:55,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:55,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:55,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:55,145 INFO L87 Difference]: Start difference. First operand 210 states and 250 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-09 02:03:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:55,317 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2025-03-09 02:03:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:03:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-03-09 02:03:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:55,318 INFO L225 Difference]: With dead ends: 235 [2025-03-09 02:03:55,318 INFO L226 Difference]: Without dead ends: 233 [2025-03-09 02:03:55,318 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-09 02:03:55,318 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 92 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:55,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 156 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-09 02:03:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2025-03-09 02:03:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.515527950310559) internal successors, (244), 206 states have internal predecessors, (244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 250 transitions. [2025-03-09 02:03:55,323 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 250 transitions. Word has length 27 [2025-03-09 02:03:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:55,323 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 250 transitions. [2025-03-09 02:03:55,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-09 02:03:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 250 transitions. [2025-03-09 02:03:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:03:55,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:55,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:03:55,324 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1186870023, now seen corresponding path program 1 times [2025-03-09 02:03:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236511277] [2025-03-09 02:03:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:55,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:03:55,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:03:55,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:55,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:55,367 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-09 02:03:55,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:55,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236511277] [2025-03-09 02:03:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236511277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995071441] [2025-03-09 02:03:55,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:55,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:55,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:55,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:55,368 INFO L87 Difference]: Start difference. First operand 211 states and 250 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:55,539 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2025-03-09 02:03:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:03:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-09 02:03:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:55,540 INFO L225 Difference]: With dead ends: 229 [2025-03-09 02:03:55,540 INFO L226 Difference]: Without dead ends: 227 [2025-03-09 02:03:55,540 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-09 02:03:55,540 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:55,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 160 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-09 02:03:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2025-03-09 02:03:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 162 states have (on average 1.5061728395061729) internal successors, (244), 207 states have internal predecessors, (244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2025-03-09 02:03:55,545 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 28 [2025-03-09 02:03:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:55,545 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2025-03-09 02:03:55,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:03:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2025-03-09 02:03:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 02:03:55,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:55,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:55,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:03:55,545 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:55,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1442248241, now seen corresponding path program 1 times [2025-03-09 02:03:55,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946874553] [2025-03-09 02:03:55,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:55,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:03:55,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:03:55,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:55,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:55,591 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-09 02:03:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946874553] [2025-03-09 02:03:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946874553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388131938] [2025-03-09 02:03:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:55,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:55,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:55,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:55,593 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:55,730 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2025-03-09 02:03:55,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:03:55,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-03-09 02:03:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:55,731 INFO L225 Difference]: With dead ends: 228 [2025-03-09 02:03:55,731 INFO L226 Difference]: Without dead ends: 227 [2025-03-09 02:03:55,731 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-09 02:03:55,732 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 172 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:55,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 113 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-09 02:03:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 216. [2025-03-09 02:03:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 166 states have (on average 1.5) internal successors, (249), 211 states have internal predecessors, (249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2025-03-09 02:03:55,737 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 255 transitions. Word has length 38 [2025-03-09 02:03:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:55,737 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 255 transitions. [2025-03-09 02:03:55,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions. [2025-03-09 02:03:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 02:03:55,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:55,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:55,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:03:55,740 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:55,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1760022488, now seen corresponding path program 1 times [2025-03-09 02:03:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960842642] [2025-03-09 02:03:55,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:55,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 02:03:55,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 02:03:55,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:55,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:55,780 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-09 02:03:55,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:55,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960842642] [2025-03-09 02:03:55,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960842642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:55,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:55,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696888696] [2025-03-09 02:03:55,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:55,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:55,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:55,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:55,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:55,781 INFO L87 Difference]: Start difference. First operand 216 states and 255 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:55,851 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2025-03-09 02:03:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:03:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-03-09 02:03:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:55,852 INFO L225 Difference]: With dead ends: 216 [2025-03-09 02:03:55,852 INFO L226 Difference]: Without dead ends: 215 [2025-03-09 02:03:55,852 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-09 02:03:55,852 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:55,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 143 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-09 02:03:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-09 02:03:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 166 states have (on average 1.4879518072289157) internal successors, (247), 210 states have internal predecessors, (247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2025-03-09 02:03:55,857 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 39 [2025-03-09 02:03:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:55,857 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2025-03-09 02:03:55,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2025-03-09 02:03:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:03:55,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:55,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:55,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:03:55,858 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:55,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1317775772, now seen corresponding path program 1 times [2025-03-09 02:03:55,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:55,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785806735] [2025-03-09 02:03:55,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:55,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:03:55,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:03:55,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:55,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:55,890 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-09 02:03:55,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:55,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785806735] [2025-03-09 02:03:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785806735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:55,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:55,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503162138] [2025-03-09 02:03:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:55,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:55,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:55,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:55,892 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:56,006 INFO L93 Difference]: Finished difference Result 215 states and 253 transitions. [2025-03-09 02:03:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:03:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-03-09 02:03:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:56,008 INFO L225 Difference]: With dead ends: 215 [2025-03-09 02:03:56,008 INFO L226 Difference]: Without dead ends: 214 [2025-03-09 02:03:56,008 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-09 02:03:56,009 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:56,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 115 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-09 02:03:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-09 02:03:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 166 states have (on average 1.4819277108433735) internal successors, (246), 209 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 252 transitions. [2025-03-09 02:03:56,014 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 252 transitions. Word has length 40 [2025-03-09 02:03:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:56,014 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 252 transitions. [2025-03-09 02:03:56,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 252 transitions. [2025-03-09 02:03:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 02:03:56,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:56,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:56,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:03:56,015 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:56,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash 835504358, now seen corresponding path program 1 times [2025-03-09 02:03:56,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:56,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176581782] [2025-03-09 02:03:56,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:56,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 02:03:56,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 02:03:56,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:56,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:56,046 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-09 02:03:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176581782] [2025-03-09 02:03:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176581782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857040916] [2025-03-09 02:03:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:56,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:56,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:56,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:56,048 INFO L87 Difference]: Start difference. First operand 214 states and 252 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:56,104 INFO L93 Difference]: Finished difference Result 234 states and 274 transitions. [2025-03-09 02:03:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:03:56,104 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-03-09 02:03:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:56,105 INFO L225 Difference]: With dead ends: 234 [2025-03-09 02:03:56,105 INFO L226 Difference]: Without dead ends: 232 [2025-03-09 02:03:56,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:56,106 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:56,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 310 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-09 02:03:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2025-03-09 02:03:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 181 states have (on average 1.4585635359116023) internal successors, (264), 224 states have internal predecessors, (264), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 270 transitions. [2025-03-09 02:03:56,111 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 270 transitions. Word has length 41 [2025-03-09 02:03:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:56,111 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 270 transitions. [2025-03-09 02:03:56,111 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 270 transitions. [2025-03-09 02:03:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 02:03:56,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:56,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:56,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:03:56,112 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:56,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2098623993, now seen corresponding path program 1 times [2025-03-09 02:03:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:56,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50778748] [2025-03-09 02:03:56,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:56,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 02:03:56,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 02:03:56,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:56,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:56,180 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-09 02:03:56,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50778748] [2025-03-09 02:03:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50778748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:56,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:56,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:03:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106262479] [2025-03-09 02:03:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:56,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:03:56,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:56,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:03:56,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:03:56,182 INFO L87 Difference]: Start difference. First operand 229 states and 270 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:56,344 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2025-03-09 02:03:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:03:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-03-09 02:03:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:56,346 INFO L225 Difference]: With dead ends: 230 [2025-03-09 02:03:56,346 INFO L226 Difference]: Without dead ends: 229 [2025-03-09 02:03:56,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-09 02:03:56,346 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 151 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:56,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 164 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:03:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-09 02:03:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-03-09 02:03:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 181 states have (on average 1.4530386740331491) internal successors, (263), 224 states have internal predecessors, (263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 269 transitions. [2025-03-09 02:03:56,351 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 269 transitions. Word has length 41 [2025-03-09 02:03:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:56,351 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 269 transitions. [2025-03-09 02:03:56,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 269 transitions. [2025-03-09 02:03:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:03:56,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:56,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:56,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 02:03:56,352 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:56,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash -632834310, now seen corresponding path program 1 times [2025-03-09 02:03:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:56,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557892936] [2025-03-09 02:03:56,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:56,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:56,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:03:56,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:03:56,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:56,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:56,383 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-09 02:03:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557892936] [2025-03-09 02:03:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557892936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:03:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:03:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115384943] [2025-03-09 02:03:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:56,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:03:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:56,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:03:56,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:56,385 INFO L87 Difference]: Start difference. First operand 229 states and 269 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:56,432 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2025-03-09 02:03:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:03:56,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-03-09 02:03:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:56,433 INFO L225 Difference]: With dead ends: 271 [2025-03-09 02:03:56,433 INFO L226 Difference]: Without dead ends: 269 [2025-03-09 02:03:56,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:03:56,434 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 307 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-09 02:03:56,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 307 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:03:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-09 02:03:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2025-03-09 02:03:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 189 states have (on average 1.4285714285714286) internal successors, (270), 232 states have internal predecessors, (270), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:03:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 276 transitions. [2025-03-09 02:03:56,439 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 276 transitions. Word has length 42 [2025-03-09 02:03:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 276 transitions. [2025-03-09 02:03:56,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 276 transitions. [2025-03-09 02:03:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:03:56,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:56,440 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:56,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 02:03:56,440 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:56,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1174869162, now seen corresponding path program 1 times [2025-03-09 02:03:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:56,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144340196] [2025-03-09 02:03:56,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:56,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:03:56,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:03:56,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:56,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:56,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144340196] [2025-03-09 02:03:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144340196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:03:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701198124] [2025-03-09 02:03:56,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:56,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:56,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:56,492 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-09 02:03:56,494 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-09 02:03:56,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:03:56,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:03:56,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:56,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:56,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:03:56,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:56,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:03:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701198124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:03:56,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:03:56,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-09 02:03:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042316020] [2025-03-09 02:03:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:03:56,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:03:56,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:56,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:03:56,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:03:56,595 INFO L87 Difference]: Start difference. First operand 237 states and 276 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:56,624 INFO L93 Difference]: Finished difference Result 312 states and 366 transitions. [2025-03-09 02:03:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:03:56,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 02:03:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:56,625 INFO L225 Difference]: With dead ends: 312 [2025-03-09 02:03:56,625 INFO L226 Difference]: Without dead ends: 142 [2025-03-09 02:03:56,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:03:56,626 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 113 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:56,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 270 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:03:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-09 02:03:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-09 02:03:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 139 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2025-03-09 02:03:56,629 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 44 [2025-03-09 02:03:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:56,629 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2025-03-09 02:03:56,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2025-03-09 02:03:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:03:56,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:56,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:56,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 02:03:56,830 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,SelfDestructingSolverStorable25 [2025-03-09 02:03:56,830 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:56,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2061205744, now seen corresponding path program 1 times [2025-03-09 02:03:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767111909] [2025-03-09 02:03:56,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:56,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:03:56,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:03:56,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:56,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:56,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767111909] [2025-03-09 02:03:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767111909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:03:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747814238] [2025-03-09 02:03:56,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:56,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:56,890 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-09 02:03:56,891 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-09 02:03:56,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:03:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:03:56,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:56,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:03:56,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:56,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:03:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747814238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:03:57,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:03:57,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 12 [2025-03-09 02:03:57,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827080730] [2025-03-09 02:03:57,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:03:57,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:03:57,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:57,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:03:57,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:03:57,051 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:03:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:57,098 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2025-03-09 02:03:57,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:03:57,098 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-03-09 02:03:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:57,099 INFO L225 Difference]: With dead ends: 148 [2025-03-09 02:03:57,099 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 02:03:57,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:03:57,100 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 125 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:57,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 696 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:03:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 02:03:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2025-03-09 02:03:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 138 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2025-03-09 02:03:57,105 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 45 [2025-03-09 02:03:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:57,105 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2025-03-09 02:03:57,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:03:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2025-03-09 02:03:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:03:57,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:57,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:57,112 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-09 02:03:57,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:57,306 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:57,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1367721019, now seen corresponding path program 1 times [2025-03-09 02:03:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827223279] [2025-03-09 02:03:57,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:57,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:03:57,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:03:57,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:57,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:57,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101027870] [2025-03-09 02:03:57,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:57,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:57,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:57,319 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-09 02:03:57,321 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-09 02:03:57,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:03:57,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:03:57,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:57,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:57,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:03:57,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:57,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:03:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827223279] [2025-03-09 02:03:57,858 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101027870] [2025-03-09 02:03:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101027870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:03:57,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:03:57,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 02:03:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755480370] [2025-03-09 02:03:57,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:03:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:03:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:57,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:03:57,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:03:57,860 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:03:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:58,168 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-03-09 02:03:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:03:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2025-03-09 02:03:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:58,170 INFO L225 Difference]: With dead ends: 141 [2025-03-09 02:03:58,170 INFO L226 Difference]: Without dead ends: 140 [2025-03-09 02:03:58,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:03:58,170 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 170 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:58,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 205 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:03:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-09 02:03:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-09 02:03:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 137 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2025-03-09 02:03:58,177 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 49 [2025-03-09 02:03:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:58,177 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2025-03-09 02:03:58,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:03:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2025-03-09 02:03:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:03:58,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:58,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:58,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:03:58,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 02:03:58,378 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:58,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 550321381, now seen corresponding path program 1 times [2025-03-09 02:03:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580147953] [2025-03-09 02:03:58,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:58,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:03:58,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:03:58,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:58,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:58,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979177707] [2025-03-09 02:03:58,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:58,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:58,392 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-09 02:03:58,400 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-09 02:03:58,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:03:58,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:03:58,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:58,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:58,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:03:58,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:58,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:03:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580147953] [2025-03-09 02:03:58,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979177707] [2025-03-09 02:03:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979177707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:03:58,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:03:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 02:03:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398061538] [2025-03-09 02:03:58,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:03:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:03:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:58,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:03:58,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:03:58,957 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:03:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:03:59,192 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2025-03-09 02:03:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:03:59,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-09 02:03:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:03:59,193 INFO L225 Difference]: With dead ends: 140 [2025-03-09 02:03:59,193 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 02:03:59,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:03:59,193 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 184 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:03:59,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 226 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:03:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 02:03:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-09 02:03:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 136 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:03:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2025-03-09 02:03:59,197 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 50 [2025-03-09 02:03:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:03:59,197 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2025-03-09 02:03:59,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:03:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2025-03-09 02:03:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 02:03:59,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:03:59,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:03:59,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 02:03:59,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 02:03:59,399 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:03:59,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:03:59,399 INFO L85 PathProgramCache]: Analyzing trace with hash -119906365, now seen corresponding path program 1 times [2025-03-09 02:03:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:03:59,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84954416] [2025-03-09 02:03:59,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:03:59,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:03:59,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:03:59,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:59,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:03:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097035684] [2025-03-09 02:03:59,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:03:59,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:03:59,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:03:59,411 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-09 02:03:59,413 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-09 02:03:59,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:03:59,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:03:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:03:59,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:03:59,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:03:59,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:03:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:59,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:03:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:03:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:03:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84954416] [2025-03-09 02:03:59,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:03:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097035684] [2025-03-09 02:03:59,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097035684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:03:59,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:03:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 02:03:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880521553] [2025-03-09 02:03:59,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:03:59,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:03:59,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:03:59,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:03:59,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:03:59,671 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:00,050 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2025-03-09 02:04:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:04:00,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-03-09 02:04:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:00,051 INFO L225 Difference]: With dead ends: 139 [2025-03-09 02:04:00,051 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 02:04:00,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:04:00,051 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 137 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:00,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 159 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:04:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 02:04:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-09 02:04:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.226890756302521) internal successors, (146), 135 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2025-03-09 02:04:00,055 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 51 [2025-03-09 02:04:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:00,055 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2025-03-09 02:04:00,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2025-03-09 02:04:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 02:04:00,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:00,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:00,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:00,256 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1284736252, now seen corresponding path program 1 times [2025-03-09 02:04:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099837962] [2025-03-09 02:04:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:00,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:04:00,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:04:00,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:00,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246073730] [2025-03-09 02:04:00,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:00,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:00,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:00,280 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-09 02:04:00,282 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-09 02:04:00,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:04:00,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:04:00,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:00,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:00,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:04:00,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:00,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:04:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099837962] [2025-03-09 02:04:00,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246073730] [2025-03-09 02:04:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246073730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:00,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:00,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:04:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675195591] [2025-03-09 02:04:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:00,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:04:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:00,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:04:00,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:04:00,425 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:00,482 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2025-03-09 02:04:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:04:00,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 02:04:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:00,483 INFO L225 Difference]: With dead ends: 138 [2025-03-09 02:04:00,483 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 02:04:00,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:04:00,484 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 12 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:00,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 317 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 02:04:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-09 02:04:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.218487394957983) internal successors, (145), 134 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2025-03-09 02:04:00,487 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 51 [2025-03-09 02:04:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:00,488 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2025-03-09 02:04:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2025-03-09 02:04:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:04:00,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:00,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:00,494 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-09 02:04:00,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:00,689 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 577869987, now seen corresponding path program 1 times [2025-03-09 02:04:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460935800] [2025-03-09 02:04:00,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:00,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:04:00,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:04:00,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414158371] [2025-03-09 02:04:00,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:00,702 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-09 02:04:00,704 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-09 02:04:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:04:00,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:04:00,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:00,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:00,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:04:00,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:00,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460935800] [2025-03-09 02:04:01,311 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414158371] [2025-03-09 02:04:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414158371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:01,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-09 02:04:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668349586] [2025-03-09 02:04:01,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:01,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:04:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:01,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:04:01,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:04:01,312 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:02,024 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2025-03-09 02:04:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:04:02,025 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-03-09 02:04:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:02,026 INFO L225 Difference]: With dead ends: 139 [2025-03-09 02:04:02,026 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 02:04:02,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:04:02,026 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 307 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:02,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 167 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:04:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 02:04:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-03-09 02:04:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 133 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2025-03-09 02:04:02,036 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 52 [2025-03-09 02:04:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:02,036 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2025-03-09 02:04:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2025-03-09 02:04:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:04:02,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:02,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:02,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:02,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:02,238 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1172118134, now seen corresponding path program 1 times [2025-03-09 02:04:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522550245] [2025-03-09 02:04:02,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:02,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:04:02,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:04:02,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:02,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931776630] [2025-03-09 02:04:02,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:02,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:02,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:02,254 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-09 02:04:02,256 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-09 02:04:02,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:04:02,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:04:02,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:02,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:02,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:04:02,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:02,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:02,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:02,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522550245] [2025-03-09 02:04:02,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:02,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931776630] [2025-03-09 02:04:02,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931776630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:04:02,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:04:02,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-09 02:04:02,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596897399] [2025-03-09 02:04:02,747 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:02,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:04:02,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:02,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:04:02,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:04:02,748 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:02,824 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2025-03-09 02:04:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:04:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-09 02:04:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:02,824 INFO L225 Difference]: With dead ends: 136 [2025-03-09 02:04:02,825 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 02:04:02,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:04:02,825 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:02,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 389 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 02:04:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-09 02:04:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 132 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2025-03-09 02:04:02,829 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 52 [2025-03-09 02:04:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:02,829 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2025-03-09 02:04:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2025-03-09 02:04:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 02:04:02,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:02,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:02,836 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-09 02:04:03,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-09 02:04:03,031 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:03,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1095864255, now seen corresponding path program 1 times [2025-03-09 02:04:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362523182] [2025-03-09 02:04:03,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:03,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:04:03,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:04:03,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:03,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101329497] [2025-03-09 02:04:03,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:03,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:03,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:03,041 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-09 02:04:03,043 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-09 02:04:03,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:04:03,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:04:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:03,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:04:03,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:03,119 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-09 02:04:03,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:04:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362523182] [2025-03-09 02:04:03,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101329497] [2025-03-09 02:04:03,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101329497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:03,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:03,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:04:03,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592157386] [2025-03-09 02:04:03,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:03,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:04:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:03,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:04:03,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:04:03,121 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:03,197 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2025-03-09 02:04:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:04:03,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 02:04:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:03,198 INFO L225 Difference]: With dead ends: 145 [2025-03-09 02:04:03,198 INFO L226 Difference]: Without dead ends: 144 [2025-03-09 02:04:03,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:04:03,199 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 93 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:03,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 140 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-09 02:04:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2025-03-09 02:04:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.184873949579832) internal successors, (141), 132 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2025-03-09 02:04:03,202 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 55 [2025-03-09 02:04:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:03,203 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2025-03-09 02:04:03,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2025-03-09 02:04:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 02:04:03,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:03,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:03,209 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-09 02:04:03,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-09 02:04:03,408 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:03,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash 60671258, now seen corresponding path program 1 times [2025-03-09 02:04:03,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:03,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393355653] [2025-03-09 02:04:03,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:03,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:04:03,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:04:03,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:03,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:03,453 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-09 02:04:03,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:03,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393355653] [2025-03-09 02:04:03,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393355653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:03,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:03,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:04:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858921856] [2025-03-09 02:04:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:04:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:03,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:04:03,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:04:03,454 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:03,554 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2025-03-09 02:04:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:04:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 02:04:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:03,555 INFO L225 Difference]: With dead ends: 140 [2025-03-09 02:04:03,555 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 02:04:03,555 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-09 02:04:03,555 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:03,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 81 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 02:04:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2025-03-09 02:04:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 122 states have (on average 1.180327868852459) internal successors, (144), 135 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2025-03-09 02:04:03,559 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 55 [2025-03-09 02:04:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:03,559 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2025-03-09 02:04:03,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2025-03-09 02:04:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:04:03,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:03,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:03,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 02:04:03,559 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:03,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash -387946465, now seen corresponding path program 1 times [2025-03-09 02:04:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451239208] [2025-03-09 02:04:03,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:03,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:03,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:04:03,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:04:03,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:03,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:03,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756452077] [2025-03-09 02:04:03,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:03,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:03,568 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-09 02:04:03,570 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-09 02:04:03,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:04:03,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:04:03,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:03,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:04:03,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:03,648 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-09 02:04:03,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:04:03,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451239208] [2025-03-09 02:04:03,648 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756452077] [2025-03-09 02:04:03,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756452077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:03,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:03,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:04:03,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766578443] [2025-03-09 02:04:03,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:03,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:04:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:03,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:04:03,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:04:03,649 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:03,724 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2025-03-09 02:04:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:04:03,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 02:04:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:03,724 INFO L225 Difference]: With dead ends: 147 [2025-03-09 02:04:03,724 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 02:04:03,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:04:03,725 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 148 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:03,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 122 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 02:04:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2025-03-09 02:04:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 135 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2025-03-09 02:04:03,728 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 56 [2025-03-09 02:04:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2025-03-09 02:04:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2025-03-09 02:04:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:04:03,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:03,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:03,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 02:04:03,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:03,929 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:03,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1880808972, now seen corresponding path program 1 times [2025-03-09 02:04:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124973799] [2025-03-09 02:04:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:03,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:03,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:04:03,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:04:03,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:03,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:03,989 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-09 02:04:03,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:03,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124973799] [2025-03-09 02:04:03,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124973799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:03,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:03,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:04:03,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667025353] [2025-03-09 02:04:03,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:03,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:04:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:03,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:04:03,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:04:03,991 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:04,085 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2025-03-09 02:04:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:04:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 02:04:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:04,086 INFO L225 Difference]: With dead ends: 140 [2025-03-09 02:04:04,086 INFO L226 Difference]: Without dead ends: 117 [2025-03-09 02:04:04,086 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-09 02:04:04,087 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:04,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 84 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-09 02:04:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-09 02:04:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.198019801980198) internal successors, (121), 114 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2025-03-09 02:04:04,090 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 56 [2025-03-09 02:04:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:04,090 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2025-03-09 02:04:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2025-03-09 02:04:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:04:04,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:04,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:04,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 02:04:04,091 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:04,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 858561469, now seen corresponding path program 1 times [2025-03-09 02:04:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525302939] [2025-03-09 02:04:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:04,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:04:04,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:04:04,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:04,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985869068] [2025-03-09 02:04:04,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:04,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:04,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:04,102 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-09 02:04:04,103 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-09 02:04:04,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:04:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:04:04,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:04,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:04,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:04:04,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:04,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525302939] [2025-03-09 02:04:04,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985869068] [2025-03-09 02:04:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985869068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:04,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-09 02:04:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122859995] [2025-03-09 02:04:04,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:04:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:04,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:04:04,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:04:04,511 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 14 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:04,920 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2025-03-09 02:04:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:04:04,920 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 14 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2025-03-09 02:04:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:04,921 INFO L225 Difference]: With dead ends: 121 [2025-03-09 02:04:04,921 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 02:04:04,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:04:04,922 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 187 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:04,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 156 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:04:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 02:04:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2025-03-09 02:04:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 114 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2025-03-09 02:04:04,925 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 57 [2025-03-09 02:04:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:04,925 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2025-03-09 02:04:04,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 14 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2025-03-09 02:04:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:04:04,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:04,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:04,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:05,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:05,126 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:05,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -49363650, now seen corresponding path program 1 times [2025-03-09 02:04:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:05,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817725755] [2025-03-09 02:04:05,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:05,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:04:05,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:04:05,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:05,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025153712] [2025-03-09 02:04:05,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:05,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:05,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:05,137 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-09 02:04:05,138 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-09 02:04:05,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:04:05,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:04:05,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:05,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:05,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:04:05,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:05,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:05,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817725755] [2025-03-09 02:04:05,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025153712] [2025-03-09 02:04:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025153712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:05,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-09 02:04:05,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369996259] [2025-03-09 02:04:05,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:05,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:04:05,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:05,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:04:05,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:04:05,380 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 14 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:05,743 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2025-03-09 02:04:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:04:05,744 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 14 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2025-03-09 02:04:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:05,745 INFO L225 Difference]: With dead ends: 119 [2025-03-09 02:04:05,745 INFO L226 Difference]: Without dead ends: 117 [2025-03-09 02:04:05,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:04:05,745 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 109 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:05,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 353 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:04:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-09 02:04:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-09 02:04:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 112 states have internal predecessors, (117), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2025-03-09 02:04:05,751 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 57 [2025-03-09 02:04:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:05,751 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2025-03-09 02:04:05,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 14 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2025-03-09 02:04:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:04:05,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:05,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:05,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:05,951 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,SelfDestructingSolverStorable38 [2025-03-09 02:04:05,952 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash 845601757, now seen corresponding path program 1 times [2025-03-09 02:04:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175256708] [2025-03-09 02:04:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:05,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:04:05,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:04:05,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:05,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175256708] [2025-03-09 02:04:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175256708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:04:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776921481] [2025-03-09 02:04:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:05,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:05,999 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-09 02:04:06,000 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-09 02:04:06,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:04:06,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:04:06,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:06,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:06,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:04:06,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:06,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776921481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:06,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:04:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-09 02:04:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067834138] [2025-03-09 02:04:06,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:06,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:04:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:06,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:04:06,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:04:06,142 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:04:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:06,255 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2025-03-09 02:04:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:04:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-03-09 02:04:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:06,256 INFO L225 Difference]: With dead ends: 115 [2025-03-09 02:04:06,256 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 02:04:06,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:04:06,257 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 94 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:06,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 195 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 02:04:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-09 02:04:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 111 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2025-03-09 02:04:06,260 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 58 [2025-03-09 02:04:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2025-03-09 02:04:06,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:04:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2025-03-09 02:04:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:04:06,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:06,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:06,268 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-09 02:04:06,461 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,SelfDestructingSolverStorable39 [2025-03-09 02:04:06,462 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:06,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -193827332, now seen corresponding path program 1 times [2025-03-09 02:04:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034102750] [2025-03-09 02:04:06,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:06,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:04:06,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:04:06,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:06,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:06,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258467497] [2025-03-09 02:04:06,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:06,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:06,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:06,472 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-09 02:04:06,474 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-09 02:04:06,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:04:06,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:04:06,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:06,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:06,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:04:06,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:06,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034102750] [2025-03-09 02:04:06,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258467497] [2025-03-09 02:04:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258467497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:06,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-09 02:04:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779585702] [2025-03-09 02:04:06,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:04:06,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:04:06,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:04:06,901 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:07,279 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2025-03-09 02:04:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:04:07,280 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-03-09 02:04:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:07,280 INFO L225 Difference]: With dead ends: 116 [2025-03-09 02:04:07,280 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 02:04:07,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:04:07,281 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 93 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:07,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 272 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:04:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 02:04:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-09 02:04:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 110 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2025-03-09 02:04:07,285 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 59 [2025-03-09 02:04:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:07,285 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2025-03-09 02:04:07,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 16 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2025-03-09 02:04:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:04:07,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:07,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:07,292 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-09 02:04:07,486 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,SelfDestructingSolverStorable40 [2025-03-09 02:04:07,487 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:07,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1713679998, now seen corresponding path program 1 times [2025-03-09 02:04:07,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:07,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339498433] [2025-03-09 02:04:07,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:07,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:07,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:04:07,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:04:07,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:07,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637851059] [2025-03-09 02:04:07,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:07,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:07,504 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-09 02:04:07,505 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-09 02:04:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:04:07,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:04:07,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:07,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:07,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 02:04:07,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:07,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339498433] [2025-03-09 02:04:07,939 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637851059] [2025-03-09 02:04:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637851059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:07,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-09 02:04:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964486215] [2025-03-09 02:04:07,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:07,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:04:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:07,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:04:07,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:04:07,940 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 18 states, 17 states have (on average 6.588235294117647) internal successors, (112), 18 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:08,611 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2025-03-09 02:04:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:04:08,612 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.588235294117647) internal successors, (112), 18 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-09 02:04:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:08,612 INFO L225 Difference]: With dead ends: 115 [2025-03-09 02:04:08,612 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 02:04:08,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:04:08,613 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 165 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:08,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 194 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:04:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 02:04:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-03-09 02:04:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.118811881188119) internal successors, (113), 109 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2025-03-09 02:04:08,619 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 60 [2025-03-09 02:04:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:08,619 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2025-03-09 02:04:08,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.588235294117647) internal successors, (112), 18 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2025-03-09 02:04:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 02:04:08,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:08,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:08,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-09 02:04:08,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:08,820 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1584472390, now seen corresponding path program 1 times [2025-03-09 02:04:08,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008643214] [2025-03-09 02:04:08,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:08,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 02:04:08,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 02:04:08,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:08,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000648223] [2025-03-09 02:04:08,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:08,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:08,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:08,833 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-09 02:04:08,834 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-09 02:04:08,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 02:04:08,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 02:04:08,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:08,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:08,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:04:08,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:09,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008643214] [2025-03-09 02:04:09,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000648223] [2025-03-09 02:04:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000648223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:09,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-09 02:04:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944843636] [2025-03-09 02:04:09,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:09,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:04:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:09,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:04:09,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:04:09,298 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:09,872 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2025-03-09 02:04:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:04:09,872 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2025-03-09 02:04:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:09,873 INFO L225 Difference]: With dead ends: 114 [2025-03-09 02:04:09,873 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 02:04:09,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:04:09,875 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 139 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:09,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 225 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:04:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 02:04:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-09 02:04:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.099009900990099) internal successors, (111), 107 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2025-03-09 02:04:09,879 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 61 [2025-03-09 02:04:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:09,879 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2025-03-09 02:04:09,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2025-03-09 02:04:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 02:04:09,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:09,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:09,886 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-09 02:04:10,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:10,081 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:10,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1448617127, now seen corresponding path program 1 times [2025-03-09 02:04:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:10,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561251950] [2025-03-09 02:04:10,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:10,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:04:10,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:04:10,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:10,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:10,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:10,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561251950] [2025-03-09 02:04:10,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561251950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:04:10,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640520571] [2025-03-09 02:04:10,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:10,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:10,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:10,127 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-09 02:04:10,129 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-09 02:04:10,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:04:10,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:04:10,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:10,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:04:10,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:10,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640520571] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:04:10,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:10,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-09 02:04:10,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524188641] [2025-03-09 02:04:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:10,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:04:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:10,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:04:10,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:04:10,351 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:10,449 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2025-03-09 02:04:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:04:10,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-09 02:04:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:10,449 INFO L225 Difference]: With dead ends: 113 [2025-03-09 02:04:10,450 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 02:04:10,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:04:10,450 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 76 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:10,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 88 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 02:04:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-09 02:04:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 107 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2025-03-09 02:04:10,455 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 62 [2025-03-09 02:04:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:10,455 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2025-03-09 02:04:10,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2025-03-09 02:04:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 02:04:10,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:10,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:10,461 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-09 02:04:10,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:10,656 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:10,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1957457993, now seen corresponding path program 1 times [2025-03-09 02:04:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534189325] [2025-03-09 02:04:10,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:10,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:04:10,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:04:10,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:10,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:10,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534189325] [2025-03-09 02:04:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534189325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:10,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:04:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19255304] [2025-03-09 02:04:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:10,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:04:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:10,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:04:10,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:04:10,695 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:10,782 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2025-03-09 02:04:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:04:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-09 02:04:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:10,783 INFO L225 Difference]: With dead ends: 113 [2025-03-09 02:04:10,783 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 02:04:10,783 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-09 02:04:10,784 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:10,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 190 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 02:04:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-09 02:04:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.0792079207920793) internal successors, (109), 107 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2025-03-09 02:04:10,788 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 63 [2025-03-09 02:04:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:10,788 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2025-03-09 02:04:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2025-03-09 02:04:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:04:10,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:10,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-09 02:04:10,789 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:10,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash -551655657, now seen corresponding path program 1 times [2025-03-09 02:04:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780138001] [2025-03-09 02:04:10,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:10,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:04:10,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:04:10,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024724814] [2025-03-09 02:04:10,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:10,800 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-09 02:04:10,802 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-09 02:04:10,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:04:10,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:04:10,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:10,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:10,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:04:10,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:11,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780138001] [2025-03-09 02:04:11,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024724814] [2025-03-09 02:04:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024724814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:11,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-09 02:04:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164070547] [2025-03-09 02:04:11,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:04:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:11,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:04:11,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:04:11,254 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:11,820 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2025-03-09 02:04:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:04:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2025-03-09 02:04:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:11,821 INFO L225 Difference]: With dead ends: 113 [2025-03-09 02:04:11,821 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 02:04:11,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:04:11,821 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 92 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:11,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 147 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:04:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 02:04:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-09 02:04:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 107 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2025-03-09 02:04:11,825 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 64 [2025-03-09 02:04:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:11,825 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2025-03-09 02:04:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2025-03-09 02:04:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:04:11,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:11,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:11,831 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-09 02:04:12,025 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,SelfDestructingSolverStorable45 [2025-03-09 02:04:12,026 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:12,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash 941158012, now seen corresponding path program 1 times [2025-03-09 02:04:12,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:12,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520766742] [2025-03-09 02:04:12,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:12,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:04:12,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:04:12,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:12,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073180866] [2025-03-09 02:04:12,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:12,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:12,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:12,038 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-09 02:04:12,040 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-09 02:04:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:04:12,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:04:12,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:12,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:12,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:04:12,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:12,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520766742] [2025-03-09 02:04:12,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073180866] [2025-03-09 02:04:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073180866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:12,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:12,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-09 02:04:12,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865441679] [2025-03-09 02:04:12,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:12,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:04:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:12,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:04:12,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:04:12,587 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand has 18 states, 17 states have (on average 7.294117647058823) internal successors, (124), 18 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:13,455 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2025-03-09 02:04:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:04:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.294117647058823) internal successors, (124), 18 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2025-03-09 02:04:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:13,456 INFO L225 Difference]: With dead ends: 112 [2025-03-09 02:04:13,456 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 02:04:13,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:04:13,456 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 139 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:13,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 208 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:04:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 02:04:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-03-09 02:04:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 106 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2025-03-09 02:04:13,460 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 66 [2025-03-09 02:04:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:13,460 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2025-03-09 02:04:13,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.294117647058823) internal successors, (124), 18 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2025-03-09 02:04:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 02:04:13,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:13,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:13,467 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-09 02:04:13,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-09 02:04:13,661 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:13,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1828823117, now seen corresponding path program 1 times [2025-03-09 02:04:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526112151] [2025-03-09 02:04:13,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:04:13,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:04:13,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:13,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526112151] [2025-03-09 02:04:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526112151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:13,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:13,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:04:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839327383] [2025-03-09 02:04:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:04:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:13,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:04:13,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:04:13,712 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:13,798 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2025-03-09 02:04:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:04:13,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2025-03-09 02:04:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:13,799 INFO L225 Difference]: With dead ends: 112 [2025-03-09 02:04:13,799 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 02:04:13,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-09 02:04:13,799 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:13,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 02:04:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-09 02:04:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 107 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2025-03-09 02:04:13,804 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 67 [2025-03-09 02:04:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:13,804 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2025-03-09 02:04:13,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2025-03-09 02:04:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 02:04:13,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:13,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:13,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-09 02:04:13,805 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:13,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash -888872716, now seen corresponding path program 1 times [2025-03-09 02:04:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763025755] [2025-03-09 02:04:13,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:13,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:04:13,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:04:13,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:13,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226285035] [2025-03-09 02:04:13,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:13,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:13,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:13,815 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-09 02:04:13,817 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-09 02:04:13,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:04:13,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:04:13,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:13,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:13,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:04:13,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:14,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763025755] [2025-03-09 02:04:14,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226285035] [2025-03-09 02:04:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226285035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:14,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-09 02:04:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96658448] [2025-03-09 02:04:14,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:14,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:04:14,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:14,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:04:14,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:04:14,396 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand has 18 states, 17 states have (on average 7.176470588235294) internal successors, (122), 18 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:15,025 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2025-03-09 02:04:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:04:15,025 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.176470588235294) internal successors, (122), 18 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-03-09 02:04:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:15,026 INFO L225 Difference]: With dead ends: 111 [2025-03-09 02:04:15,026 INFO L226 Difference]: Without dead ends: 110 [2025-03-09 02:04:15,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:04:15,026 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 98 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:15,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 194 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:04:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-09 02:04:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-09 02:04:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 106 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2025-03-09 02:04:15,030 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 67 [2025-03-09 02:04:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2025-03-09 02:04:15,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.176470588235294) internal successors, (122), 18 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2025-03-09 02:04:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:04:15,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:15,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:15,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:15,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-09 02:04:15,231 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:15,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash -858941805, now seen corresponding path program 1 times [2025-03-09 02:04:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:15,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12249071] [2025-03-09 02:04:15,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:15,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:15,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:04:15,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:04:15,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:15,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:15,263 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-09 02:04:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12249071] [2025-03-09 02:04:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12249071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:04:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:04:15,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058269489] [2025-03-09 02:04:15,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:15,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:04:15,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:15,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:04:15,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:04:15,265 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:15,320 INFO L93 Difference]: Finished difference Result 111 states and 110 transitions. [2025-03-09 02:04:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:04:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2025-03-09 02:04:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:15,321 INFO L225 Difference]: With dead ends: 111 [2025-03-09 02:04:15,321 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 02:04:15,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:04:15,321 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:15,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 99 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:04:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 02:04:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 02:04:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 74 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 76 transitions. [2025-03-09 02:04:15,325 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 76 transitions. Word has length 68 [2025-03-09 02:04:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:15,325 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 76 transitions. [2025-03-09 02:04:15,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 76 transitions. [2025-03-09 02:04:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:04:15,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:15,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:15,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-09 02:04:15,326 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:15,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1785250438, now seen corresponding path program 1 times [2025-03-09 02:04:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957631462] [2025-03-09 02:04:15,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:15,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:04:15,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:04:15,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:15,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842828920] [2025-03-09 02:04:15,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:15,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:15,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:15,340 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:04:15,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-09 02:04:15,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:04:15,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:04:15,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:15,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:15,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:04:15,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:15,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957631462] [2025-03-09 02:04:15,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842828920] [2025-03-09 02:04:15,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842828920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:15,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-09 02:04:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753692553] [2025-03-09 02:04:15,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:15,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:04:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:15,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:04:15,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:04:15,971 INFO L87 Difference]: Start difference. First operand 77 states and 76 transitions. Second operand has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:16,584 INFO L93 Difference]: Finished difference Result 77 states and 76 transitions. [2025-03-09 02:04:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:04:16,585 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2025-03-09 02:04:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:16,585 INFO L225 Difference]: With dead ends: 77 [2025-03-09 02:04:16,585 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:04:16,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:04:16,586 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 71 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:16,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 166 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:04:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:04:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 02:04:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.042857142857143) internal successors, (73), 73 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 75 transitions. [2025-03-09 02:04:16,589 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 75 transitions. Word has length 68 [2025-03-09 02:04:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 75 transitions. [2025-03-09 02:04:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 75 transitions. [2025-03-09 02:04:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:04:16,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:16,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:16,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:16,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-03-09 02:04:16,790 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:16,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash 491811250, now seen corresponding path program 1 times [2025-03-09 02:04:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:16,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854800757] [2025-03-09 02:04:16,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:16,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:04:16,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:04:16,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:16,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:16,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854800757] [2025-03-09 02:04:16,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854800757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:04:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782475813] [2025-03-09 02:04:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:16,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:16,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:16,835 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:04:16,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-09 02:04:16,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:04:16,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:04:16,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:16,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:16,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:04:16,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:16,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:04:16,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782475813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:16,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:04:16,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 02:04:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238370881] [2025-03-09 02:04:16,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:16,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:04:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:16,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:04:16,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:04:16,918 INFO L87 Difference]: Start difference. First operand 76 states and 75 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:16,939 INFO L93 Difference]: Finished difference Result 76 states and 75 transitions. [2025-03-09 02:04:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:04:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-03-09 02:04:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:16,940 INFO L225 Difference]: With dead ends: 76 [2025-03-09 02:04:16,940 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 02:04:16,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:04:16,941 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:16,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 156 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:04:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 02:04:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-09 02:04:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 72 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 74 transitions. [2025-03-09 02:04:16,945 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 74 transitions. Word has length 69 [2025-03-09 02:04:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:16,945 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 74 transitions. [2025-03-09 02:04:16,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 74 transitions. [2025-03-09 02:04:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 02:04:16,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:16,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:16,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:17,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:17,146 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:17,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1933720456, now seen corresponding path program 1 times [2025-03-09 02:04:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879429539] [2025-03-09 02:04:17,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:17,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:04:17,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:04:17,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:17,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:17,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:17,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879429539] [2025-03-09 02:04:17,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879429539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:04:17,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655103737] [2025-03-09 02:04:17,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:17,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:17,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:17,190 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:04:17,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-09 02:04:17,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:04:17,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:04:17,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:17,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:17,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:04:17,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:17,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655103737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:17,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:04:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 02:04:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515411995] [2025-03-09 02:04:17,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:04:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:17,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:04:17,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:04:17,324 INFO L87 Difference]: Start difference. First operand 75 states and 74 transitions. Second operand has 10 states, 9 states have (on average 17.88888888888889) internal successors, (161), 10 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:04:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:17,342 INFO L93 Difference]: Finished difference Result 75 states and 74 transitions. [2025-03-09 02:04:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:04:17,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.88888888888889) internal successors, (161), 10 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 70 [2025-03-09 02:04:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:17,343 INFO L225 Difference]: With dead ends: 75 [2025-03-09 02:04:17,343 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 02:04:17,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:04:17,343 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:17,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 211 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:04:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 02:04:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-09 02:04:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 71 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 73 transitions. [2025-03-09 02:04:17,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 73 transitions. Word has length 70 [2025-03-09 02:04:17,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:17,346 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 73 transitions. [2025-03-09 02:04:17,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.88888888888889) internal successors, (161), 10 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:04:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 73 transitions. [2025-03-09 02:04:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 02:04:17,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:17,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:17,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:17,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-03-09 02:04:17,549 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:17,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:17,549 INFO L85 PathProgramCache]: Analyzing trace with hash 184207984, now seen corresponding path program 1 times [2025-03-09 02:04:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:17,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883797191] [2025-03-09 02:04:17,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:17,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 02:04:17,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 02:04:17,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:17,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883797191] [2025-03-09 02:04:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883797191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:04:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230199331] [2025-03-09 02:04:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:17,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:17,599 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:04:17,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-09 02:04:17,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 02:04:17,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 02:04:17,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:17,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:17,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:04:17,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:17,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:04:17,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230199331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:04:17,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:04:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-09 02:04:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608807908] [2025-03-09 02:04:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:04:17,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:04:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:17,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:04:17,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:04:17,708 INFO L87 Difference]: Start difference. First operand 74 states and 73 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:17,741 INFO L93 Difference]: Finished difference Result 74 states and 73 transitions. [2025-03-09 02:04:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:04:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2025-03-09 02:04:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:17,742 INFO L225 Difference]: With dead ends: 74 [2025-03-09 02:04:17,742 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 02:04:17,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:04:17,742 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:17,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:04:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 02:04:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 02:04:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 70 states have (on average 1.0) internal successors, (70), 70 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 72 transitions. [2025-03-09 02:04:17,745 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 72 transitions. Word has length 71 [2025-03-09 02:04:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:17,746 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 72 transitions. [2025-03-09 02:04:17,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:04:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 72 transitions. [2025-03-09 02:04:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 02:04:17,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:04:17,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:17,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-03-09 02:04:17,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:17,947 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-09 02:04:17,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:04:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1415480182, now seen corresponding path program 1 times [2025-03-09 02:04:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:04:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680704374] [2025-03-09 02:04:17,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:04:17,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 02:04:17,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 02:04:17,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:17,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:04:17,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021988350] [2025-03-09 02:04:17,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:04:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:17,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:04:17,961 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:04:17,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-09 02:04:17,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 02:04:17,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 02:04:17,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:04:17,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:04:17,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:04:17,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:04:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:18,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:04:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:04:18,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:04:18,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680704374] [2025-03-09 02:04:18,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:04:18,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021988350] [2025-03-09 02:04:18,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021988350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:04:18,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:04:18,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-09 02:04:18,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87231175] [2025-03-09 02:04:18,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:04:18,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:04:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:04:18,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:04:18,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:04:18,584 INFO L87 Difference]: Start difference. First operand 73 states and 72 transitions. Second operand has 18 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:04:19,107 INFO L93 Difference]: Finished difference Result 73 states and 72 transitions. [2025-03-09 02:04:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:04:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 72 [2025-03-09 02:04:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:04:19,108 INFO L225 Difference]: With dead ends: 73 [2025-03-09 02:04:19,108 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:04:19,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:04:19,108 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 58 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:04:19,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 115 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:04:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:04:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:04:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-09 02:04:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:04:19,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2025-03-09 02:04:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:04:19,109 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:04:19,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:04:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:04:19,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 60 remaining) [2025-03-09 02:04:19,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 60 remaining) [2025-03-09 02:04:19,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 60 remaining) [2025-03-09 02:04:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 60 remaining) [2025-03-09 02:04:19,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-03-09 02:04:19,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:04:19,316 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:04:19,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:04:20,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:04:20,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:04:20 BoogieIcfgContainer [2025-03-09 02:04:20,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:04:20,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:04:20,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:04:20,418 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:04:20,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:03:48" (3/4) ... [2025-03-09 02:04:20,420 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:04:20,428 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:04:20,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:04:20,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:04:20,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:04:20,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:04:20,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:04:20,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:04:20,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:04:20,499 INFO L158 Benchmark]: Toolchain (without parser) took 32742.35ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 109.1MB in the beginning and 239.4MB in the end (delta: -130.3MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2025-03-09 02:04:20,499 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:04:20,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.22ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 97.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:04:20,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:04:20,503 INFO L158 Benchmark]: Boogie Preprocessor took 32.27ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:04:20,504 INFO L158 Benchmark]: IcfgBuilder took 424.21ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 73.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:04:20,504 INFO L158 Benchmark]: TraceAbstraction took 32005.91ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 72.1MB in the beginning and 243.4MB in the end (delta: -171.2MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. [2025-03-09 02:04:20,504 INFO L158 Benchmark]: Witness Printer took 80.15ms. Allocated memory is still 343.9MB. Free memory was 243.4MB in the beginning and 239.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:04:20,504 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.22ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 97.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.27ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 424.21ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 73.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32005.91ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 72.1MB in the beginning and 243.4MB in the end (delta: -171.2MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. * Witness Printer took 80.15ms. Allocated memory is still 343.9MB. Free memory was 243.4MB in the beginning and 239.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 146 edges, 60 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 55, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6293 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6278 mSDsluCounter, 11015 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7639 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12975 IncrementalHoareTripleChecker+Invalid, 13185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 3376 mSDtfsCounter, 12975 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2961 GetRequests, 2478 SyntacticMatches, 0 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=25, InterpolantAutomatonStates: 399, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 945 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 4009 NumberOfCodeBlocks, 4009 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 3727 ConstructedInterpolants, 8 QuantifiedInterpolants, 31096 SizeOfPredicates, 58 NumberOfNonLiveVariables, 3517 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 80 InterpolantComputations, 37 PerfectInterpolantSequences, 38/205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 60 specifications checked. All of them hold - InvariantResult [Line: 31]: Location Invariant Derived location invariant: (((((((((((((xy == 0) && (X <= 2147483647)) && (0 <= Y)) && (((long long) Y * 4) == ((__int128) v + ((long long) 3 * X)))) && (0 <= yx)) && (x == 1)) && (y == 1)) && (Y <= 2147483647)) && (0 <= X)) && (counter == 1)) && (yx <= 1073741823)) || (((((((((((((long long) Y * 4) == ((__int128) X + v)) && (xy == 0)) && (X <= 2147483647)) && (0 <= (Y + 2147483648))) && (0 <= yx)) && (x == 1)) && (y == 0)) && (0 <= X)) && (counter == 1)) && (yx <= 1073741823)) && (((__int128) v + 1) <= ((long long) 2 * Y)))) || ((((((((0 <= (Y + 2147483648)) && (y == 0)) && (((long long) 2 * Y) == ((__int128) X + v))) && (0 <= (X + 2147483648))) && (counter == 0)) && (((long long) 2 * Y) <= ((__int128) 2147483647 + v))) && (x == 0)) && ((((__int128) X + v) + ((long long) 2 * Y)) <= 8589934588))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:04:20,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE