./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound100.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/sqrt1-ll_unwindbound100.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 aeeaf8ddcaaadce0bb307be8d4cdfb2d28179f7ce6737573dce6c1be4b061da1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:38:23,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:38:24,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:38:24,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:38:24,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:38:24,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:38:24,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:38:24,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:38:24,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:38:24,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:38:24,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:38:24,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:38:24,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:38:24,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:38:24,075 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:38:24,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:38:24,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:38:24,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:38:24,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:38:24,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:38:24,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:38:24,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:38:24,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:38:24,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:38:24,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:38:24,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:38:24,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:38:24,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:38:24,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:38:24,078 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 -> aeeaf8ddcaaadce0bb307be8d4cdfb2d28179f7ce6737573dce6c1be4b061da1 [2025-03-09 02:38:24,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:38:24,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:38:24,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:38:24,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:38:24,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:38:24,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound100.c [2025-03-09 02:38:25,431 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754ca8ee8/8d2e8c4c88694de9bf4878e71f436824/FLAG832b7db10 [2025-03-09 02:38:25,647 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:38:25,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound100.c [2025-03-09 02:38:25,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754ca8ee8/8d2e8c4c88694de9bf4878e71f436824/FLAG832b7db10 [2025-03-09 02:38:25,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754ca8ee8/8d2e8c4c88694de9bf4878e71f436824 [2025-03-09 02:38:25,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:38:25,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:38:25,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:38:25,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:38:25,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:38:25,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a50554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25, skipping insertion in model container [2025-03-09 02:38:25,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:38:25,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:38:25,798 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:38:25,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:38:25,823 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:38:25,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25 WrapperNode [2025-03-09 02:38:25,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:38:25,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:38:25,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:38:25,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:38:25,828 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:38:25" (1/1) ... [2025-03-09 02:38:25,832 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:38:25" (1/1) ... [2025-03-09 02:38:25,848 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-03-09 02:38:25,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:38:25,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:38:25,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:38:25,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:38:25,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,872 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:38:25,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:38:25,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:38:25,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:38:25,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:38:25,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (1/1) ... [2025-03-09 02:38:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:38:25,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:25,906 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:38:25,912 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:38:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:38:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:38:25,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:38:25,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:38:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:38:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:38:25,968 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:38:25,969 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:38:26,183 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-09 02:38:26,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:38:26,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:38:26,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:38:26,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:38:26 BoogieIcfgContainer [2025-03-09 02:38:26,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:38:26,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:38:26,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:38:26,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:38:26,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:38:25" (1/3) ... [2025-03-09 02:38:26,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22244ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:38:26, skipping insertion in model container [2025-03-09 02:38:26,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:38:25" (2/3) ... [2025-03-09 02:38:26,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22244ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:38:26, skipping insertion in model container [2025-03-09 02:38:26,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:38:26" (3/3) ... [2025-03-09 02:38:26,202 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound100.c [2025-03-09 02:38:26,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:38:26,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll_unwindbound100.c that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 52 error locations. [2025-03-09 02:38:26,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:38:26,271 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;@5b83f813, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:38:26,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-09 02:38:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:38:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 02:38:26,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:26,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 02:38:26,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:26,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:26,282 INFO L85 PathProgramCache]: Analyzing trace with hash 4616543, now seen corresponding path program 1 times [2025-03-09 02:38:26,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:26,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697262533] [2025-03-09 02:38:26,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:26,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 02:38:26,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 02:38:26,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:26,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:26,421 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:38:26,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697262533] [2025-03-09 02:38:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697262533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:26,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:26,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:38:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475129526] [2025-03-09 02:38:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:38:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:26,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:38:26,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:38:26,440 INFO L87 Difference]: Start difference. First operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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:38:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:26,502 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2025-03-09 02:38:26,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:38:26,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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:38:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:26,509 INFO L225 Difference]: With dead ends: 247 [2025-03-09 02:38:26,509 INFO L226 Difference]: Without dead ends: 118 [2025-03-09 02:38:26,511 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:38:26,513 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:26,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 360 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:38:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-09 02:38:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-09 02:38:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 64 states have (on average 1.765625) internal successors, (113), 111 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:38:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2025-03-09 02:38:26,544 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 4 [2025-03-09 02:38:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:26,544 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2025-03-09 02:38:26,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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:38:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2025-03-09 02:38:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:38:26,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:26,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:38:26,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:26,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash 92561394, now seen corresponding path program 1 times [2025-03-09 02:38:26,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:26,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041632943] [2025-03-09 02:38:26,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:26,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:38:26,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:38:26,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:26,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:26,587 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:38:26,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041632943] [2025-03-09 02:38:26,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041632943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:26,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:26,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:38:26,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502275106] [2025-03-09 02:38:26,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:26,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:38:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:26,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:38:26,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:38:26,588 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:38:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:26,691 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-03-09 02:38:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:38:26,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:38:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:26,692 INFO L225 Difference]: With dead ends: 212 [2025-03-09 02:38:26,692 INFO L226 Difference]: Without dead ends: 192 [2025-03-09 02:38:26,693 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:38:26,693 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 68 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:26,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 173 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-09 02:38:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-03-09 02:38:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.6161616161616161) internal successors, (160), 146 states have internal predecessors, (160), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:38:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2025-03-09 02:38:26,707 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 7 [2025-03-09 02:38:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:26,707 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2025-03-09 02:38:26,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:38:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2025-03-09 02:38:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:38:26,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:26,707 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] [2025-03-09 02:38:26,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:38:26,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:26,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash 265858617, now seen corresponding path program 1 times [2025-03-09 02:38:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123560132] [2025-03-09 02:38:26,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:26,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:38:26,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:38:26,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:26,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:38:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535669673] [2025-03-09 02:38:26,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:26,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:26,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:26,727 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:38:26,729 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:38:26,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:38:26,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:38:26,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:26,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:26,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:38:26,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:26,831 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:38:26,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:38:26,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123560132] [2025-03-09 02:38:26,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:38:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535669673] [2025-03-09 02:38:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535669673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:38:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941112715] [2025-03-09 02:38:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:26,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:38:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:26,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:38:26,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:38:26,833 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:26,934 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2025-03-09 02:38:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:38:26,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-09 02:38:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:26,936 INFO L225 Difference]: With dead ends: 184 [2025-03-09 02:38:26,936 INFO L226 Difference]: Without dead ends: 176 [2025-03-09 02:38:26,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:38:26,938 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:26,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 179 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-09 02:38:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2025-03-09 02:38:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 109 states have (on average 1.5688073394495412) internal successors, (171), 156 states have internal predecessors, (171), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:38:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 191 transitions. [2025-03-09 02:38:26,953 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 191 transitions. Word has length 28 [2025-03-09 02:38:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:26,954 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 191 transitions. [2025-03-09 02:38:26,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 191 transitions. [2025-03-09 02:38:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:38:26,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:26,955 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] [2025-03-09 02:38:26,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:38:27,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:27,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:27,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -348317412, now seen corresponding path program 1 times [2025-03-09 02:38:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:27,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690686881] [2025-03-09 02:38:27,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:27,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:27,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:38:27,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:38:27,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:27,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:27,245 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:38:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690686881] [2025-03-09 02:38:27,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690686881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:27,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:27,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:38:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880362863] [2025-03-09 02:38:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:27,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:38:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:27,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:38:27,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:38:27,247 INFO L87 Difference]: Start difference. First operand 168 states and 191 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:27,324 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2025-03-09 02:38:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:38:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-09 02:38:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:27,325 INFO L225 Difference]: With dead ends: 184 [2025-03-09 02:38:27,325 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 02:38:27,325 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:38:27,326 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:27,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 173 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 02:38:27,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-09 02:38:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 159 states have internal predecessors, (167), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:38:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2025-03-09 02:38:27,339 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 29 [2025-03-09 02:38:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:27,339 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2025-03-09 02:38:27,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2025-03-09 02:38:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:38:27,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:27,340 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] [2025-03-09 02:38:27,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:38:27,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:27,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash -82983179, now seen corresponding path program 1 times [2025-03-09 02:38:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121163895] [2025-03-09 02:38:27,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:27,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:38:27,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:38:27,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:27,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:27,423 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:38:27,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:27,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121163895] [2025-03-09 02:38:27,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121163895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:27,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:27,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:38:27,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271437655] [2025-03-09 02:38:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:38:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:27,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:38:27,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:38:27,426 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:27,511 INFO L93 Difference]: Finished difference Result 176 states and 192 transitions. [2025-03-09 02:38:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:38:27,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-09 02:38:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:27,512 INFO L225 Difference]: With dead ends: 176 [2025-03-09 02:38:27,512 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 02:38:27,513 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:38:27,513 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:27,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 179 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 02:38:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-09 02:38:27,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 159 states have internal predecessors, (165), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:38:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2025-03-09 02:38:27,530 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 32 [2025-03-09 02:38:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:27,530 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2025-03-09 02:38:27,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2025-03-09 02:38:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:38:27,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:27,531 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] [2025-03-09 02:38:27,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:38:27,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1605607503, now seen corresponding path program 1 times [2025-03-09 02:38:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:27,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990888277] [2025-03-09 02:38:27,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:27,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:38:27,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:38:27,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:27,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:27,622 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:38:27,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:27,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990888277] [2025-03-09 02:38:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990888277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:27,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:38:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739234085] [2025-03-09 02:38:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:27,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:38:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:27,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:38:27,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:38:27,625 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:27,712 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2025-03-09 02:38:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:38:27,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-09 02:38:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:27,714 INFO L225 Difference]: With dead ends: 176 [2025-03-09 02:38:27,714 INFO L226 Difference]: Without dead ends: 148 [2025-03-09 02:38:27,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:38:27,715 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 29 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:27,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 155 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-09 02:38:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-09 02:38:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 138 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:38:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2025-03-09 02:38:27,722 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 36 [2025-03-09 02:38:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:27,722 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2025-03-09 02:38:27,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:38:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2025-03-09 02:38:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:38:27,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:27,723 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:27,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:38:27,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:27,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:27,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1607185735, now seen corresponding path program 1 times [2025-03-09 02:38:27,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:27,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634411575] [2025-03-09 02:38:27,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:27,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:38:27,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:38:27,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:27,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:27,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634411575] [2025-03-09 02:38:27,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634411575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:27,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:27,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:38:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628365647] [2025-03-09 02:38:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:38:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:27,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:38:27,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:38:27,835 INFO L87 Difference]: Start difference. First operand 148 states and 156 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:27,945 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2025-03-09 02:38:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:38:27,945 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-09 02:38:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:27,947 INFO L225 Difference]: With dead ends: 151 [2025-03-09 02:38:27,947 INFO L226 Difference]: Without dead ends: 150 [2025-03-09 02:38:27,947 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:38:27,948 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:27,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 224 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-09 02:38:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2025-03-09 02:38:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 139 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:38:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2025-03-09 02:38:27,954 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 49 [2025-03-09 02:38:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:27,954 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2025-03-09 02:38:27,955 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2025-03-09 02:38:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:38:27,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:27,955 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:38:27,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:27,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1716849787, now seen corresponding path program 1 times [2025-03-09 02:38:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247371019] [2025-03-09 02:38:27,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:27,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:38:27,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:38:27,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:27,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247371019] [2025-03-09 02:38:28,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247371019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:28,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:38:28,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:38:28,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954137715] [2025-03-09 02:38:28,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:28,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:38:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:28,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:38:28,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:38:28,039 INFO L87 Difference]: Start difference. First operand 149 states and 157 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:28,121 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2025-03-09 02:38:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:38:28,124 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-09 02:38:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:28,125 INFO L225 Difference]: With dead ends: 151 [2025-03-09 02:38:28,125 INFO L226 Difference]: Without dead ends: 150 [2025-03-09 02:38:28,126 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:38:28,126 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:28,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-09 02:38:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-09 02:38:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 140 states have internal predecessors, (142), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:38:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2025-03-09 02:38:28,133 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 50 [2025-03-09 02:38:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:28,133 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2025-03-09 02:38:28,133 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2025-03-09 02:38:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:38:28,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:28,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:28,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:38:28,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:28,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 625206425, now seen corresponding path program 1 times [2025-03-09 02:38:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844727139] [2025-03-09 02:38:28,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:28,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:28,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:38:28,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:38:28,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:28,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:28,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:28,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844727139] [2025-03-09 02:38:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844727139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943296562] [2025-03-09 02:38:28,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:28,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:28,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:28,243 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:38:28,249 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:38:28,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:38:28,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:38:28,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:28,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:28,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:38:28,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:28,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:38:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943296562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:38:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:38:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130930797] [2025-03-09 02:38:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:28,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:38:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:28,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:38:28,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:38:28,384 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:28,406 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2025-03-09 02:38:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:38:28,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-09 02:38:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:28,407 INFO L225 Difference]: With dead ends: 150 [2025-03-09 02:38:28,407 INFO L226 Difference]: Without dead ends: 149 [2025-03-09 02:38:28,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:38:28,408 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:28,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:38:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-09 02:38:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-09 02:38:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 139 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:38:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2025-03-09 02:38:28,415 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 52 [2025-03-09 02:38:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:28,415 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2025-03-09 02:38:28,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2025-03-09 02:38:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:38:28,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:28,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:28,422 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:38:28,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-09 02:38:28,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:28,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2093437222, now seen corresponding path program 1 times [2025-03-09 02:38:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:28,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121476425] [2025-03-09 02:38:28,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:28,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:38:28,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:38:28,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121476425] [2025-03-09 02:38:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121476425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367236940] [2025-03-09 02:38:28,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:28,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:28,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:28,708 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:38:28,710 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:38:28,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:38:28,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:38:28,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:28,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:28,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:38:28,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:28,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:38:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367236940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:28,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:38:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:38:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715568177] [2025-03-09 02:38:28,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:28,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:38:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:28,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:38:28,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:38:28,803 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:28,845 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2025-03-09 02:38:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:38:28,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-09 02:38:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:28,846 INFO L225 Difference]: With dead ends: 197 [2025-03-09 02:38:28,846 INFO L226 Difference]: Without dead ends: 196 [2025-03-09 02:38:28,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:38:28,847 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 77 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:28,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 506 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:38:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-09 02:38:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 164. [2025-03-09 02:38:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.528301886792453) internal successors, (162), 152 states have internal predecessors, (162), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:38:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 182 transitions. [2025-03-09 02:38:28,852 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 182 transitions. Word has length 53 [2025-03-09 02:38:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:28,852 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 182 transitions. [2025-03-09 02:38:28,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2025-03-09 02:38:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 02:38:28,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:28,853 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:28,859 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:38:29,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:29,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:29,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1748473254, now seen corresponding path program 1 times [2025-03-09 02:38:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031194864] [2025-03-09 02:38:29,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:29,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:38:29,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:38:29,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:29,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:29,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031194864] [2025-03-09 02:38:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031194864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330307098] [2025-03-09 02:38:29,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:29,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:29,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:29,108 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:38:29,109 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:38:29,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:38:29,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:38:29,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:29,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:29,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:38:29,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:29,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:38:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330307098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:38:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:38:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221011620] [2025-03-09 02:38:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:38:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:29,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:38:29,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:38:29,206 INFO L87 Difference]: Start difference. First operand 164 states and 182 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:29,276 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2025-03-09 02:38:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:38:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-03-09 02:38:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:29,278 INFO L225 Difference]: With dead ends: 164 [2025-03-09 02:38:29,279 INFO L226 Difference]: Without dead ends: 155 [2025-03-09 02:38:29,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:38:29,279 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:29,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 139 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-09 02:38:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-09 02:38:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.4056603773584906) internal successors, (149), 143 states have internal predecessors, (149), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:38:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2025-03-09 02:38:29,286 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 55 [2025-03-09 02:38:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:29,287 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2025-03-09 02:38:29,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:38:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2025-03-09 02:38:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:38:29,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:29,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:29,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:38:29,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:29,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:29,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:29,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1631903990, now seen corresponding path program 1 times [2025-03-09 02:38:29,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290977854] [2025-03-09 02:38:29,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:29,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:29,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:38:29,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:38:29,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:29,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:29,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:29,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290977854] [2025-03-09 02:38:29,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290977854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:29,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090465909] [2025-03-09 02:38:29,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:29,538 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:38:29,540 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:38:29,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:38:29,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:38:29,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:29,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:29,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:38:29,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:29,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:29,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090465909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:29,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:29,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:38:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69782342] [2025-03-09 02:38:29,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:29,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:38:29,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:29,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:38:29,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:38:29,690 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-09 02:38:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:29,797 INFO L93 Difference]: Finished difference Result 279 states and 330 transitions. [2025-03-09 02:38:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:38:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2025-03-09 02:38:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:29,799 INFO L225 Difference]: With dead ends: 279 [2025-03-09 02:38:29,799 INFO L226 Difference]: Without dead ends: 270 [2025-03-09 02:38:29,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:38:29,799 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 186 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:29,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 235 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-09 02:38:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 146. [2025-03-09 02:38:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 134 states have internal predecessors, (136), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:38:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2025-03-09 02:38:29,809 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 56 [2025-03-09 02:38:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:29,810 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2025-03-09 02:38:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-09 02:38:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2025-03-09 02:38:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:38:29,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:29,811 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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:38:29,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:38:30,011 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,SelfDestructingSolverStorable11 [2025-03-09 02:38:30,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:30,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash -116901071, now seen corresponding path program 1 times [2025-03-09 02:38:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:30,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438249947] [2025-03-09 02:38:30,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:30,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:38:30,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:38:30,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:30,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:38:30,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:30,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438249947] [2025-03-09 02:38:30,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438249947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:30,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975798400] [2025-03-09 02:38:30,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:30,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:30,083 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:38:30,085 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:38:30,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:38:30,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:38:30,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:30,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:30,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:38:30,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:38:30,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:38:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975798400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:30,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-03-09 02:38:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074372420] [2025-03-09 02:38:30,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:30,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:38:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:30,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:38:30,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:38:30,254 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-09 02:38:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:30,365 INFO L93 Difference]: Finished difference Result 378 states and 398 transitions. [2025-03-09 02:38:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:38:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 69 [2025-03-09 02:38:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:30,366 INFO L225 Difference]: With dead ends: 378 [2025-03-09 02:38:30,366 INFO L226 Difference]: Without dead ends: 338 [2025-03-09 02:38:30,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:38:30,367 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 222 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:30,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 796 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-09 02:38:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 258. [2025-03-09 02:38:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 205 states have (on average 1.3219512195121952) internal successors, (271), 235 states have internal predecessors, (271), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-09 02:38:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions. [2025-03-09 02:38:30,377 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 69 [2025-03-09 02:38:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:30,377 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions. [2025-03-09 02:38:30,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-09 02:38:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions. [2025-03-09 02:38:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:38:30,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:30,378 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:30,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:38:30,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:30,579 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:30,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash 594944254, now seen corresponding path program 1 times [2025-03-09 02:38:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:30,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714148866] [2025-03-09 02:38:30,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:30,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:30,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:38:30,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:38:30,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:30,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:38:30,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733808189] [2025-03-09 02:38:30,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:30,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:30,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:30,597 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:38:30,599 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:38:30,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:38:30,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:38:30,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:30,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:30,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:38:30,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:38:30,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:38:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714148866] [2025-03-09 02:38:30,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:38:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733808189] [2025-03-09 02:38:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733808189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:30,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:38:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 02:38:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001568223] [2025-03-09 02:38:30,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:38:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:30,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:38:30,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:38:30,800 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:38:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:30,959 INFO L93 Difference]: Finished difference Result 347 states and 368 transitions. [2025-03-09 02:38:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:38:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2025-03-09 02:38:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:30,961 INFO L225 Difference]: With dead ends: 347 [2025-03-09 02:38:30,961 INFO L226 Difference]: Without dead ends: 345 [2025-03-09 02:38:30,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:38:30,962 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 339 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:30,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 318 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-09 02:38:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 269. [2025-03-09 02:38:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 215 states have (on average 1.283720930232558) internal successors, (276), 245 states have internal predecessors, (276), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-09 02:38:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 318 transitions. [2025-03-09 02:38:30,974 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 318 transitions. Word has length 69 [2025-03-09 02:38:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:30,975 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 318 transitions. [2025-03-09 02:38:30,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:38:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 318 transitions. [2025-03-09 02:38:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 02:38:30,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:30,976 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:30,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:38:31,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:31,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:31,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -211905677, now seen corresponding path program 1 times [2025-03-09 02:38:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550727884] [2025-03-09 02:38:31,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:31,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:38:31,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:38:31,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:31,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:38:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695632756] [2025-03-09 02:38:31,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:31,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:31,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:31,195 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:38:31,196 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:38:31,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:38:31,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:38:31,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:31,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:31,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:38:31,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:31,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:31,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:31,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550727884] [2025-03-09 02:38:31,414 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:38:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695632756] [2025-03-09 02:38:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695632756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:31,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:38:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 02:38:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978043041] [2025-03-09 02:38:31,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:31,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:38:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:38:31,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:38:31,415 INFO L87 Difference]: Start difference. First operand 269 states and 318 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-09 02:38:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:31,611 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2025-03-09 02:38:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:38:31,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 76 [2025-03-09 02:38:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:31,613 INFO L225 Difference]: With dead ends: 308 [2025-03-09 02:38:31,613 INFO L226 Difference]: Without dead ends: 300 [2025-03-09 02:38:31,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:38:31,614 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 150 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:31,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 285 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:38:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-09 02:38:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 268. [2025-03-09 02:38:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 219 states have (on average 1.2054794520547945) internal successors, (264), 242 states have internal predecessors, (264), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:38:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2025-03-09 02:38:31,624 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 76 [2025-03-09 02:38:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:31,624 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2025-03-09 02:38:31,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-09 02:38:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2025-03-09 02:38:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 02:38:31,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:31,625 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:31,631 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:38:31,825 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,SelfDestructingSolverStorable14 [2025-03-09 02:38:31,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:31,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2020858658, now seen corresponding path program 1 times [2025-03-09 02:38:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:31,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333354181] [2025-03-09 02:38:31,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:31,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:38:31,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:38:31,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:31,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:31,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:31,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333354181] [2025-03-09 02:38:31,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333354181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:31,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318474013] [2025-03-09 02:38:31,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:31,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:31,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:31,906 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:38:31,915 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:38:31,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:38:31,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:38:31,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:31,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:31,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:38:31,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:32,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318474013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:32,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:32,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 02:38:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123114258] [2025-03-09 02:38:32,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:38:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:32,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:38:32,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:38:32,218 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-09 02:38:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:32,385 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2025-03-09 02:38:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:38:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 77 [2025-03-09 02:38:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:32,387 INFO L225 Difference]: With dead ends: 268 [2025-03-09 02:38:32,387 INFO L226 Difference]: Without dead ends: 265 [2025-03-09 02:38:32,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:38:32,387 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 150 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:32,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 196 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-09 02:38:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-09 02:38:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.17351598173516) internal successors, (257), 239 states have internal predecessors, (257), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:38:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 301 transitions. [2025-03-09 02:38:32,398 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 301 transitions. Word has length 77 [2025-03-09 02:38:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:32,398 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 301 transitions. [2025-03-09 02:38:32,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-09 02:38:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 301 transitions. [2025-03-09 02:38:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:38:32,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:32,399 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:32,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:38:32,599 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,SelfDestructingSolverStorable15 [2025-03-09 02:38:32,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1777890991, now seen corresponding path program 1 times [2025-03-09 02:38:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299778467] [2025-03-09 02:38:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:32,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:38:32,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:38:32,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:32,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299778467] [2025-03-09 02:38:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299778467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996252644] [2025-03-09 02:38:32,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:32,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:32,674 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:38:32,676 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:38:32,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:38:32,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:38:32,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:32,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:32,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:38:32,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:32,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996252644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:32,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:32,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 02:38:32,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953102302] [2025-03-09 02:38:32,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:32,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:38:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:32,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:38:32,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:38:32,931 INFO L87 Difference]: Start difference. First operand 265 states and 301 transitions. Second operand has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-09 02:38:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:33,129 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2025-03-09 02:38:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:38:33,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 78 [2025-03-09 02:38:33,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:33,130 INFO L225 Difference]: With dead ends: 282 [2025-03-09 02:38:33,131 INFO L226 Difference]: Without dead ends: 273 [2025-03-09 02:38:33,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:38:33,131 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:33,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 260 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:38:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-09 02:38:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 261. [2025-03-09 02:38:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 221 states have (on average 1.1040723981900453) internal successors, (244), 235 states have internal predecessors, (244), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:38:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 288 transitions. [2025-03-09 02:38:33,146 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 288 transitions. Word has length 78 [2025-03-09 02:38:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:33,146 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 288 transitions. [2025-03-09 02:38:33,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-09 02:38:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 288 transitions. [2025-03-09 02:38:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:38:33,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:33,146 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:33,152 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:38:33,351 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,SelfDestructingSolverStorable16 [2025-03-09 02:38:33,351 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:33,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash 843743023, now seen corresponding path program 1 times [2025-03-09 02:38:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:33,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599400308] [2025-03-09 02:38:33,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:33,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:38:33,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:38:33,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:33,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:33,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599400308] [2025-03-09 02:38:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599400308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55741317] [2025-03-09 02:38:33,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:33,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:33,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:33,421 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:38:33,422 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:38:33,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:38:33,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:38:33,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:33,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:33,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:38:33,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:38:33,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:38:33,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55741317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:33,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:38:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 02:38:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577988872] [2025-03-09 02:38:33,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:33,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:38:33,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:33,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:38:33,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:38:33,638 INFO L87 Difference]: Start difference. First operand 261 states and 288 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:38:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:33,757 INFO L93 Difference]: Finished difference Result 261 states and 288 transitions. [2025-03-09 02:38:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:38:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-09 02:38:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:33,758 INFO L225 Difference]: With dead ends: 261 [2025-03-09 02:38:33,758 INFO L226 Difference]: Without dead ends: 207 [2025-03-09 02:38:33,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:38:33,759 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 61 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:33,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 165 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-09 02:38:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-09 02:38:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 179 states have (on average 1.0446927374301676) internal successors, (187), 185 states have internal predecessors, (187), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 02:38:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 219 transitions. [2025-03-09 02:38:33,767 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 219 transitions. Word has length 80 [2025-03-09 02:38:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:33,767 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 219 transitions. [2025-03-09 02:38:33,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:38:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2025-03-09 02:38:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-09 02:38:33,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:33,768 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 02:38:33,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:38:33,971 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,SelfDestructingSolverStorable17 [2025-03-09 02:38:33,971 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:33,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash 678603759, now seen corresponding path program 1 times [2025-03-09 02:38:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:33,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108786804] [2025-03-09 02:38:33,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:33,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-09 02:38:33,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-09 02:38:33,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:33,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-09 02:38:34,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:34,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108786804] [2025-03-09 02:38:34,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108786804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:34,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768713496] [2025-03-09 02:38:34,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:34,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:34,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:34,113 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:38:34,115 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:38:34,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-09 02:38:34,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-09 02:38:34,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:34,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:34,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:38:34,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-09 02:38:34,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-09 02:38:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768713496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:34,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-09 02:38:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684155474] [2025-03-09 02:38:34,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:34,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:38:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:34,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:38:34,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:38:34,662 INFO L87 Difference]: Start difference. First operand 207 states and 219 transitions. Second operand has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-09 02:38:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:34,979 INFO L93 Difference]: Finished difference Result 334 states and 368 transitions. [2025-03-09 02:38:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:38:34,980 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 146 [2025-03-09 02:38:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:34,981 INFO L225 Difference]: With dead ends: 334 [2025-03-09 02:38:34,982 INFO L226 Difference]: Without dead ends: 333 [2025-03-09 02:38:34,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:38:34,982 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:34,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 453 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:38:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-09 02:38:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 297. [2025-03-09 02:38:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 262 states have (on average 1.0610687022900764) internal successors, (278), 268 states have internal predecessors, (278), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-09 02:38:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 324 transitions. [2025-03-09 02:38:34,993 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 324 transitions. Word has length 146 [2025-03-09 02:38:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:34,994 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 324 transitions. [2025-03-09 02:38:34,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-09 02:38:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 324 transitions. [2025-03-09 02:38:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-09 02:38:34,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:34,995 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-09 02:38:35,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 02:38:35,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:35,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1849412923, now seen corresponding path program 2 times [2025-03-09 02:38:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633119170] [2025-03-09 02:38:35,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:35,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-09 02:38:35,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-09 02:38:35,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:35,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-09 02:38:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633119170] [2025-03-09 02:38:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633119170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594942828] [2025-03-09 02:38:35,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:35,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:35,406 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:38:35,407 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:38:35,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-09 02:38:35,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-09 02:38:35,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:35,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:35,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:38:35,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-09 02:38:35,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-09 02:38:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594942828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:36,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:36,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-09 02:38:36,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142885843] [2025-03-09 02:38:36,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 02:38:36,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:36,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 02:38:36,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:38:36,048 INFO L87 Difference]: Start difference. First operand 297 states and 324 transitions. Second operand has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-09 02:38:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:36,414 INFO L93 Difference]: Finished difference Result 375 states and 410 transitions. [2025-03-09 02:38:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:38:36,414 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 174 [2025-03-09 02:38:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:36,416 INFO L225 Difference]: With dead ends: 375 [2025-03-09 02:38:36,416 INFO L226 Difference]: Without dead ends: 367 [2025-03-09 02:38:36,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:38:36,417 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 230 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:36,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 379 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:38:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-09 02:38:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 331. [2025-03-09 02:38:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 292 states have (on average 1.0582191780821917) internal successors, (309), 298 states have internal predecessors, (309), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-09 02:38:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 363 transitions. [2025-03-09 02:38:36,434 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 363 transitions. Word has length 174 [2025-03-09 02:38:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:36,434 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 363 transitions. [2025-03-09 02:38:36,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-09 02:38:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 363 transitions. [2025-03-09 02:38:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-09 02:38:36,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:36,436 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:36,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:38:36,636 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,SelfDestructingSolverStorable19 [2025-03-09 02:38:36,636 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:36,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash 183393091, now seen corresponding path program 2 times [2025-03-09 02:38:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983183694] [2025-03-09 02:38:36,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:36,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-09 02:38:36,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 02:38:36,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:36,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 02:38:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983183694] [2025-03-09 02:38:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983183694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358922893] [2025-03-09 02:38:36,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:36,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:36,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:36,927 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:38:36,929 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:38:36,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-09 02:38:36,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 02:38:36,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:36,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:36,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:38:36,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 448 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:38:37,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 02:38:37,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358922893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:37,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:37,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 26 [2025-03-09 02:38:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375377078] [2025-03-09 02:38:37,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:37,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 02:38:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:37,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 02:38:37,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:38:37,447 INFO L87 Difference]: Start difference. First operand 331 states and 363 transitions. Second operand has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 9 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) [2025-03-09 02:38:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:37,789 INFO L93 Difference]: Finished difference Result 485 states and 515 transitions. [2025-03-09 02:38:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 02:38:37,789 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 9 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) Word has length 213 [2025-03-09 02:38:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:37,792 INFO L225 Difference]: With dead ends: 485 [2025-03-09 02:38:37,792 INFO L226 Difference]: Without dead ends: 448 [2025-03-09 02:38:37,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=604, Invalid=1288, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 02:38:37,794 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 156 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:37,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1079 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:38:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-09 02:38:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 433. [2025-03-09 02:38:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 383 states have (on average 1.0574412532637076) internal successors, (405), 389 states have internal predecessors, (405), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-09 02:38:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 469 transitions. [2025-03-09 02:38:37,807 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 469 transitions. Word has length 213 [2025-03-09 02:38:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:37,807 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 469 transitions. [2025-03-09 02:38:37,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 9 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) [2025-03-09 02:38:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 469 transitions. [2025-03-09 02:38:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-09 02:38:37,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:37,808 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-09 02:38:37,814 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:38:38,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:38,009 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash 895238416, now seen corresponding path program 2 times [2025-03-09 02:38:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381661683] [2025-03-09 02:38:38,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:38,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-09 02:38:38,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 02:38:38,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:38,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:38:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960514243] [2025-03-09 02:38:38,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:38,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:38,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:38,031 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:38:38,032 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:38:38,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-09 02:38:38,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 02:38:38,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:38,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:38,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:38:38,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 02:38:38,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 02:38:38,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:38,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381661683] [2025-03-09 02:38:38,550 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:38:38,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960514243] [2025-03-09 02:38:38,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960514243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:38,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:38:38,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 02:38:38,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380123922] [2025-03-09 02:38:38,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:38,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:38:38,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:38,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:38:38,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:38:38,552 INFO L87 Difference]: Start difference. First operand 433 states and 469 transitions. Second operand has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-09 02:38:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:38,899 INFO L93 Difference]: Finished difference Result 455 states and 482 transitions. [2025-03-09 02:38:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:38:38,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 213 [2025-03-09 02:38:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:38,902 INFO L225 Difference]: With dead ends: 455 [2025-03-09 02:38:38,902 INFO L226 Difference]: Without dead ends: 454 [2025-03-09 02:38:38,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:38:38,903 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 145 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:38,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 815 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:38:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-09 02:38:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 444. [2025-03-09 02:38:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 393 states have (on average 1.0432569974554708) internal successors, (410), 399 states have internal predecessors, (410), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 02:38:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 476 transitions. [2025-03-09 02:38:38,921 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 476 transitions. Word has length 213 [2025-03-09 02:38:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:38,921 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 476 transitions. [2025-03-09 02:38:38,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-09 02:38:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 476 transitions. [2025-03-09 02:38:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-09 02:38:38,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:38,923 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-09 02:38:38,930 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:38:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:39,127 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2044093663, now seen corresponding path program 2 times [2025-03-09 02:38:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974264503] [2025-03-09 02:38:39,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:39,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-09 02:38:39,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 220 of 220 statements. [2025-03-09 02:38:39,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:38:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743626090] [2025-03-09 02:38:39,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:39,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:39,152 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:38:39,153 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:38:39,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-09 02:38:39,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 220 of 220 statements. [2025-03-09 02:38:39,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:39,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:39,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:38:39,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-09 02:38:39,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-09 02:38:39,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974264503] [2025-03-09 02:38:39,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:38:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743626090] [2025-03-09 02:38:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743626090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:39,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:38:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 02:38:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245600247] [2025-03-09 02:38:39,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:39,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:38:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:39,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:38:39,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:38:39,774 INFO L87 Difference]: Start difference. First operand 444 states and 476 transitions. Second operand has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-09 02:38:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:40,125 INFO L93 Difference]: Finished difference Result 450 states and 481 transitions. [2025-03-09 02:38:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:38:40,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 220 [2025-03-09 02:38:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:40,127 INFO L225 Difference]: With dead ends: 450 [2025-03-09 02:38:40,127 INFO L226 Difference]: Without dead ends: 449 [2025-03-09 02:38:40,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:38:40,127 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 100 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:40,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 896 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:38:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-09 02:38:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2025-03-09 02:38:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 395 states have (on average 1.030379746835443) internal successors, (407), 401 states have internal predecessors, (407), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 02:38:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 475 transitions. [2025-03-09 02:38:40,151 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 475 transitions. Word has length 220 [2025-03-09 02:38:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:40,151 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 475 transitions. [2025-03-09 02:38:40,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-09 02:38:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 475 transitions. [2025-03-09 02:38:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-09 02:38:40,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:40,153 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-09 02:38:40,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 02:38:40,354 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,SelfDestructingSolverStorable22 [2025-03-09 02:38:40,354 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:40,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1428383017, now seen corresponding path program 2 times [2025-03-09 02:38:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072637875] [2025-03-09 02:38:40,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:40,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-03-09 02:38:40,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 338 of 338 statements. [2025-03-09 02:38:40,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:40,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-09 02:38:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:40,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072637875] [2025-03-09 02:38:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072637875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:40,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215008290] [2025-03-09 02:38:40,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:38:40,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:40,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:40,492 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:38:40,493 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:38:40,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-03-09 02:38:40,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 338 of 338 statements. [2025-03-09 02:38:40,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:38:40,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:40,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:38:40,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-09 02:38:40,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-03-09 02:38:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215008290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:41,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 02:38:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118230927] [2025-03-09 02:38:41,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:38:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:41,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:38:41,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:38:41,136 INFO L87 Difference]: Start difference. First operand 447 states and 475 transitions. Second operand has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:38:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:41,266 INFO L93 Difference]: Finished difference Result 447 states and 475 transitions. [2025-03-09 02:38:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:38:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 338 [2025-03-09 02:38:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:41,268 INFO L225 Difference]: With dead ends: 447 [2025-03-09 02:38:41,268 INFO L226 Difference]: Without dead ends: 446 [2025-03-09 02:38:41,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:38:41,269 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 241 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:41,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 245 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-09 02:38:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-03-09 02:38:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 395 states have (on average 1.0202531645569621) internal successors, (403), 400 states have internal predecessors, (403), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 02:38:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 471 transitions. [2025-03-09 02:38:41,285 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 471 transitions. Word has length 338 [2025-03-09 02:38:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:41,286 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 471 transitions. [2025-03-09 02:38:41,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:38:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 471 transitions. [2025-03-09 02:38:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-09 02:38:41,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:41,289 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1] [2025-03-09 02:38:41,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 02:38:41,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:41,490 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:41,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2088487507, now seen corresponding path program 3 times [2025-03-09 02:38:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680568312] [2025-03-09 02:38:41,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:38:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:41,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 366 statements into 10 equivalence classes. [2025-03-09 02:38:41,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 135 of 366 statements. [2025-03-09 02:38:41,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 02:38:41,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 51 proven. 466 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2025-03-09 02:38:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680568312] [2025-03-09 02:38:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680568312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483117252] [2025-03-09 02:38:41,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:38:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:41,697 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:38:41,699 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:38:41,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 366 statements into 10 equivalence classes. [2025-03-09 02:38:41,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 366 statements. [2025-03-09 02:38:41,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 02:38:41,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:41,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:38:41,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 126 proven. 176 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2025-03-09 02:38:42,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:42,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483117252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:42,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:38:42,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-09 02:38:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520844525] [2025-03-09 02:38:42,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:42,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:38:42,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:42,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:38:42,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:38:42,576 INFO L87 Difference]: Start difference. First operand 446 states and 471 transitions. Second operand has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-09 02:38:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:43,071 INFO L93 Difference]: Finished difference Result 446 states and 471 transitions. [2025-03-09 02:38:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:38:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 366 [2025-03-09 02:38:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:43,073 INFO L225 Difference]: With dead ends: 446 [2025-03-09 02:38:43,073 INFO L226 Difference]: Without dead ends: 442 [2025-03-09 02:38:43,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:38:43,074 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 388 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:43,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 165 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:38:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-09 02:38:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-09 02:38:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 393 states have (on average 1.0101781170483461) internal successors, (397), 396 states have internal predecessors, (397), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 02:38:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 465 transitions. [2025-03-09 02:38:43,130 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 465 transitions. Word has length 366 [2025-03-09 02:38:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:43,131 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 465 transitions. [2025-03-09 02:38:43,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-09 02:38:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 465 transitions. [2025-03-09 02:38:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-09 02:38:43,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:43,136 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:43,142 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:38:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:43,336 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:43,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1935798425, now seen corresponding path program 3 times [2025-03-09 02:38:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881381211] [2025-03-09 02:38:43,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:38:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:43,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 501 statements into 15 equivalence classes. [2025-03-09 02:38:43,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 473 of 501 statements. [2025-03-09 02:38:43,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-09 02:38:43,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 0 proven. 1660 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-09 02:38:44,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881381211] [2025-03-09 02:38:44,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881381211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:44,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846301519] [2025-03-09 02:38:44,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:38:44,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:44,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:44,449 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:38:44,450 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:38:44,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 501 statements into 15 equivalence classes. [2025-03-09 02:38:44,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 78 of 501 statements. [2025-03-09 02:38:44,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:38:44,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:44,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:38:44,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-03-09 02:38:44,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:38:44,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846301519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:38:44,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:38:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [31] total 37 [2025-03-09 02:38:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22329473] [2025-03-09 02:38:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:38:44,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:38:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:44,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:38:44,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 02:38:44,748 INFO L87 Difference]: Start difference. First operand 442 states and 465 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:38:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:45,186 INFO L93 Difference]: Finished difference Result 462 states and 485 transitions. [2025-03-09 02:38:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:38:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 501 [2025-03-09 02:38:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:45,189 INFO L225 Difference]: With dead ends: 462 [2025-03-09 02:38:45,189 INFO L226 Difference]: Without dead ends: 460 [2025-03-09 02:38:45,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1251, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 02:38:45,190 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:45,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 87 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:38:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-09 02:38:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 440. [2025-03-09 02:38:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 393 states have (on average 1.005089058524173) internal successors, (395), 394 states have internal predecessors, (395), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 02:38:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 463 transitions. [2025-03-09 02:38:45,232 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 463 transitions. Word has length 501 [2025-03-09 02:38:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:45,232 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 463 transitions. [2025-03-09 02:38:45,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:38:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 463 transitions. [2025-03-09 02:38:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-09 02:38:45,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:45,236 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:45,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 02:38:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:45,437 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -167457986, now seen corresponding path program 1 times [2025-03-09 02:38:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460042836] [2025-03-09 02:38:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:45,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-09 02:38:45,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-09 02:38:45,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:45,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 0 proven. 1660 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-09 02:38:46,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460042836] [2025-03-09 02:38:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460042836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176376334] [2025-03-09 02:38:46,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:38:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:46,090 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:38:46,092 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:38:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-09 02:38:46,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-09 02:38:46,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:38:46,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:46,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 02:38:46,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 240 proven. 3280 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-09 02:38:46,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3644 backedges. 0 proven. 1660 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-09 02:38:47,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176376334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:38:47,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:38:47,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 49 [2025-03-09 02:38:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682267775] [2025-03-09 02:38:47,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:47,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-09 02:38:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:47,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-09 02:38:47,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1707, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 02:38:47,267 INFO L87 Difference]: Start difference. First operand 440 states and 463 transitions. Second operand has 49 states, 49 states have (on average 14.816326530612244) internal successors, (726), 49 states have internal predecessors, (726), 21 states have call successors, (94), 12 states have call predecessors, (94), 12 states have return successors, (94), 21 states have call predecessors, (94), 21 states have call successors, (94) [2025-03-09 02:38:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:48,300 INFO L93 Difference]: Finished difference Result 936 states and 993 transitions. [2025-03-09 02:38:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-09 02:38:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 14.816326530612244) internal successors, (726), 49 states have internal predecessors, (726), 21 states have call successors, (94), 12 states have call predecessors, (94), 12 states have return successors, (94), 21 states have call predecessors, (94), 21 states have call successors, (94) Word has length 508 [2025-03-09 02:38:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:48,304 INFO L225 Difference]: With dead ends: 936 [2025-03-09 02:38:48,304 INFO L226 Difference]: Without dead ends: 917 [2025-03-09 02:38:48,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 992 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1947 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2580, Invalid=5610, Unknown=0, NotChecked=0, Total=8190 [2025-03-09 02:38:48,307 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 344 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:48,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1147 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:38:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-03-09 02:38:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 906. [2025-03-09 02:38:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 813 states have (on average 1.015990159901599) internal successors, (826), 814 states have internal predecessors, (826), 68 states have call successors, (68), 23 states have call predecessors, (68), 23 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-09 02:38:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 962 transitions. [2025-03-09 02:38:48,370 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 962 transitions. Word has length 508 [2025-03-09 02:38:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:48,370 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 962 transitions. [2025-03-09 02:38:48,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 14.816326530612244) internal successors, (726), 49 states have internal predecessors, (726), 21 states have call successors, (94), 12 states have call predecessors, (94), 12 states have return successors, (94), 21 states have call predecessors, (94), 21 states have call successors, (94) [2025-03-09 02:38:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 962 transitions. [2025-03-09 02:38:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-09 02:38:48,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:38:48,374 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-03-09 02:38:48,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-09 02:38:48,575 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,SelfDestructingSolverStorable26 [2025-03-09 02:38:48,575 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-03-09 02:38:48,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:38:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2133739907, now seen corresponding path program 3 times [2025-03-09 02:38:48,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:38:48,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497741035] [2025-03-09 02:38:48,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:38:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:38:48,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 508 statements into 15 equivalence classes. [2025-03-09 02:38:48,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 508 of 508 statements. [2025-03-09 02:38:48,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-09 02:38:48,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:38:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696872313] [2025-03-09 02:38:48,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:38:48,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:38:48,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:38:48,720 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:38:48,723 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:38:48,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 508 statements into 15 equivalence classes. [2025-03-09 02:38:48,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 48 of 508 statements. [2025-03-09 02:38:48,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 02:38:48,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:38:48,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:38:48,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:38:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 180 proven. 234 refuted. 0 times theorem prover too weak. 3370 trivial. 0 not checked. [2025-03-09 02:38:49,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:38:54,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:38:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497741035] [2025-03-09 02:38:54,582 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:38:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696872313] [2025-03-09 02:38:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696872313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:38:54,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:38:54,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-09 02:38:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479731227] [2025-03-09 02:38:54,583 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:38:54,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:38:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:38:54,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:38:54,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:38:54,583 INFO L87 Difference]: Start difference. First operand 906 states and 962 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:38:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:38:54,868 INFO L93 Difference]: Finished difference Result 908 states and 964 transitions. [2025-03-09 02:38:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:38:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 508 [2025-03-09 02:38:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:38:54,869 INFO L225 Difference]: With dead ends: 908 [2025-03-09 02:38:54,869 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:38:54,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:38:54,873 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 165 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:38:54,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 99 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:38:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:38:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:38:54,874 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:38:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:38:54,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 508 [2025-03-09 02:38:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:38:54,874 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:38:54,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:38:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:38:54,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-03-09 02:38:54,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-03-09 02:38:54,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-03-09 02:38:54,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-03-09 02:38:54,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 02:38:55,079 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,SelfDestructingSolverStorable27 [2025-03-09 02:38:55,081 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:38:55,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:39:01,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:39:01,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:39:01 BoogieIcfgContainer [2025-03-09 02:39:01,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:39:01,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:39:01,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:39:01,443 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:39:01,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:38:26" (3/4) ... [2025-03-09 02:39:01,445 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:39:01,450 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:39:01,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:39:01,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:39:01,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:39:01,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:39:01,517 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:39:01,517 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:39:01,517 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:39:01,517 INFO L158 Benchmark]: Toolchain (without parser) took 35849.54ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 105.2MB in the beginning and 317.6MB in the end (delta: -212.5MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2025-03-09 02:39:01,518 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:39:01,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.36ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:39:01,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.45ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:39:01,518 INFO L158 Benchmark]: Boogie Preprocessor took 24.89ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.2MB in the end (delta: 969.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:39:01,518 INFO L158 Benchmark]: IcfgBuilder took 315.80ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 72.5MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:39:01,518 INFO L158 Benchmark]: TraceAbstraction took 35245.17ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 71.5MB in the beginning and 325.9MB in the end (delta: -254.4MB). Peak memory consumption was 197.7MB. Max. memory is 16.1GB. [2025-03-09 02:39:01,518 INFO L158 Benchmark]: Witness Printer took 73.78ms. Allocated memory is still 394.3MB. Free memory was 325.9MB in the beginning and 317.6MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:39:01,519 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.73ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.36ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.45ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.89ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.2MB in the end (delta: 969.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 315.80ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 72.5MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35245.17ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 71.5MB in the beginning and 325.9MB in the end (delta: -254.4MB). Peak memory consumption was 197.7MB. Max. memory is 16.1GB. * Witness Printer took 73.78ms. Allocated memory is still 394.3MB. Free memory was 325.9MB in the beginning and 317.6MB in the end (delta: 8.3MB). 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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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: 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: 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: 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: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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, 125 locations, 139 edges, 52 error locations. Started 1 CEGAR loops. OverallTime: 28.8s, OverallIterations: 28, TraceHistogramMax: 32, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3725 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3658 mSDsluCounter, 10159 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7822 mSDsCounter, 475 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4818 IncrementalHoareTripleChecker+Invalid, 5293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 475 mSolverCounterUnsat, 2337 mSDtfsCounter, 4818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6431 GetRequests, 6026 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3714 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=906occurred in iteration=27, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 536 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 7967 NumberOfCodeBlocks, 6509 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 9034 ConstructedInterpolants, 4 QuantifiedInterpolants, 29923 SizeOfPredicates, 49 NumberOfNonLiveVariables, 4440 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 56 InterpolantComputations, 13 PerfectInterpolantSequences, 24907/37329 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 52 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((((((((0 <= (counter + 2147483648)) && (n <= 2147483647)) && (3 <= t)) && (1 <= a)) && (a <= 4611686018427387903)) && (counter <= 100)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1))) || (((((n <= 2147483647) && (t == 1)) && (counter == 0)) && (a == 0)) && (s == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:39:01,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE