./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/fermat2-ll_valuebound20.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 cd2a63b33e7bbe230c7b5ef9bb577263b79c304327f57b571a4977a8b534c93c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:18:54,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:18:54,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:18:54,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:18:54,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:18:55,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:18:55,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:18:55,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:18:55,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:18:55,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:18:55,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:18:55,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:18:55,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:18:55,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:18:55,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:18:55,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:18:55,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:18:55,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:18:55,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:18:55,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:18:55,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:18:55,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:18:55,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:18:55,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:18:55,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:18:55,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:18:55,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:18:55,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:18:55,023 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 -> cd2a63b33e7bbe230c7b5ef9bb577263b79c304327f57b571a4977a8b534c93c [2025-03-17 15:18:55,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:18:55,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:18:55,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:18:55,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:18:55,268 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:18:55,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound20.c [2025-03-17 15:18:56,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70226baa0/ce2964961f174e8a86467fa825bb701f/FLAG83ebf24e4 [2025-03-17 15:18:56,610 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:18:56,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound20.c [2025-03-17 15:18:56,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70226baa0/ce2964961f174e8a86467fa825bb701f/FLAG83ebf24e4 [2025-03-17 15:18:56,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70226baa0/ce2964961f174e8a86467fa825bb701f [2025-03-17 15:18:56,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:18:56,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:18:56,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:18:56,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:18:56,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:18:56,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a13fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56, skipping insertion in model container [2025-03-17 15:18:56,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:18:56,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:18:56,780 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:18:56,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:18:56,810 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:18:56,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56 WrapperNode [2025-03-17 15:18:56,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:18:56,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:18:56,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:18:56,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:18:56,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,842 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2025-03-17 15:18:56,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:18:56,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:18:56,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:18:56,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:18:56,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,865 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-17 15:18:56,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:18:56,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:18:56,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:18:56,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:18:56,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (1/1) ... [2025-03-17 15:18:56,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:18:56,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:56,904 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-17 15:18:56,905 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-17 15:18:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:18:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:18:56,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:18:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:18:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:18:56,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:18:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:18:56,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:18:56,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:18:56,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:18:57,200 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-17 15:18:57,201 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:18:57,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:18:57,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:18:57,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:57 BoogieIcfgContainer [2025-03-17 15:18:57,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:18:57,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:18:57,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:18:57,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:18:57,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:18:56" (1/3) ... [2025-03-17 15:18:57,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d259370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:57, skipping insertion in model container [2025-03-17 15:18:57,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:56" (2/3) ... [2025-03-17 15:18:57,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d259370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:57, skipping insertion in model container [2025-03-17 15:18:57,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:57" (3/3) ... [2025-03-17 15:18:57,221 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound20.c [2025-03-17 15:18:57,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:18:57,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat2-ll_valuebound20.c that has 3 procedures, 133 locations, 1 initial locations, 1 loop locations, and 56 error locations. [2025-03-17 15:18:57,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:18:57,284 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;@39555bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:18:57,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-17 15:18:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 124 states have internal predecessors, (129), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:18:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:18:57,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:57,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:57,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:57,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash -829246380, now seen corresponding path program 1 times [2025-03-17 15:18:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366580235] [2025-03-17 15:18:57,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:57,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:18:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:18:57,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,458 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-17 15:18:57,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366580235] [2025-03-17 15:18:57,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366580235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:57,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:57,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117091149] [2025-03-17 15:18:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:57,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:57,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:57,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:57,480 INFO L87 Difference]: Start difference. First operand has 133 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 124 states have internal predecessors, (129), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:57,555 INFO L93 Difference]: Finished difference Result 254 states and 285 transitions. [2025-03-17 15:18:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:57,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2025-03-17 15:18:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:57,563 INFO L225 Difference]: With dead ends: 254 [2025-03-17 15:18:57,563 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 15:18:57,565 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-17 15:18:57,567 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:57,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 206 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 15:18:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 15:18:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 111 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2025-03-17 15:18:57,610 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 13 [2025-03-17 15:18:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:57,612 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2025-03-17 15:18:57,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2025-03-17 15:18:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:18:57,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:57,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:57,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:18:57,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 63166084, now seen corresponding path program 1 times [2025-03-17 15:18:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428853708] [2025-03-17 15:18:57,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:57,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:18:57,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:18:57,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,669 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-17 15:18:57,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:57,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428853708] [2025-03-17 15:18:57,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428853708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:57,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:57,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555421059] [2025-03-17 15:18:57,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:57,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:57,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:57,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:57,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:57,672 INFO L87 Difference]: Start difference. First operand 119 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:57,724 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2025-03-17 15:18:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:57,724 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-17 15:18:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:57,727 INFO L225 Difference]: With dead ends: 119 [2025-03-17 15:18:57,727 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 15:18:57,727 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-17 15:18:57,728 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:57,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 197 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 15:18:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-17 15:18:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 107 states have internal predecessors, (109), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2025-03-17 15:18:57,737 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 14 [2025-03-17 15:18:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:57,737 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2025-03-17 15:18:57,737 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2025-03-17 15:18:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 15:18:57,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:57,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:57,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:18:57,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:57,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash 961892864, now seen corresponding path program 1 times [2025-03-17 15:18:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171663310] [2025-03-17 15:18:57,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:57,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:18:57,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:18:57,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737378622] [2025-03-17 15:18:57,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:57,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:57,771 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-17 15:18:57,773 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-17 15:18:57,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:18:57,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:18:57,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:18:57,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:18:57,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:18:57,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:57,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171663310] [2025-03-17 15:18:57,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:57,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737378622] [2025-03-17 15:18:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737378622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:57,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:18:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646582077] [2025-03-17 15:18:57,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:57,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:18:57,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:57,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:18:57,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:18:57,886 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:18:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:57,945 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2025-03-17 15:18:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:18:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-17 15:18:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:57,946 INFO L225 Difference]: With dead ends: 115 [2025-03-17 15:18:57,946 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 15:18:57,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:18:57,947 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:57,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 371 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 15:18:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 15:18:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.621212121212121) internal successors, (107), 105 states have internal predecessors, (107), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2025-03-17 15:18:57,953 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 18 [2025-03-17 15:18:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:57,953 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2025-03-17 15:18:57,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:18:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2025-03-17 15:18:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:18:57,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:57,954 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-17 15:18:57,960 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-17 15:18:58,154 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-17 15:18:58,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:58,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash 136539210, now seen corresponding path program 1 times [2025-03-17 15:18:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956940874] [2025-03-17 15:18:58,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:58,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:18:58,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:18:58,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:58,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:58,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267223405] [2025-03-17 15:18:58,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:58,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:58,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:58,190 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-17 15:18:58,192 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-17 15:18:58,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:18:58,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:18:58,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:58,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:58,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:18:58,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:58,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:18:58,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956940874] [2025-03-17 15:18:58,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267223405] [2025-03-17 15:18:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267223405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:18:58,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:18:58,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-17 15:18:58,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055959302] [2025-03-17 15:18:58,400 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:18:58,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:18:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:58,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:18:58,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:18:58,401 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:18:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:58,465 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2025-03-17 15:18:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:18:58,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-03-17 15:18:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:58,469 INFO L225 Difference]: With dead ends: 113 [2025-03-17 15:18:58,469 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 15:18:58,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:18:58,469 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:58,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 287 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:18:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 15:18:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 15:18:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 102 states have internal predecessors, (104), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-17 15:18:58,485 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 35 [2025-03-17 15:18:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:58,485 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-17 15:18:58,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:18:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-17 15:18:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:18:58,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:58,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-17 15:18:58,492 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-17 15:18:58,686 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,SelfDestructingSolverStorable3 [2025-03-17 15:18:58,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:58,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash -62251724, now seen corresponding path program 1 times [2025-03-17 15:18:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:58,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933849045] [2025-03-17 15:18:58,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:58,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:18:58,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:18:58,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:58,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933849045] [2025-03-17 15:18:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933849045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:18:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667936208] [2025-03-17 15:18:58,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:58,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:58,876 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-17 15:18:58,878 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-17 15:18:58,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:18:58,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:18:58,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:58,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:58,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:18:58,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:58,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:18:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667936208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:18:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 15:18:58,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54666450] [2025-03-17 15:18:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:58,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:18:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:58,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:18:58,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:18:58,998 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:59,069 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2025-03-17 15:18:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:18:59,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-03-17 15:18:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:59,071 INFO L225 Difference]: With dead ends: 110 [2025-03-17 15:18:59,071 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 15:18:59,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:18:59,071 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 78 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:59,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 365 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:18:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 15:18:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 15:18:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 101 states have internal predecessors, (103), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2025-03-17 15:18:59,082 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 36 [2025-03-17 15:18:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:59,082 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2025-03-17 15:18:59,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2025-03-17 15:18:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 15:18:59,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:59,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 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-17 15:18:59,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:18:59,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:59,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:59,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1929803385, now seen corresponding path program 1 times [2025-03-17 15:18:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:59,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538044815] [2025-03-17 15:18:59,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:59,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:18:59,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:18:59,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:18:59,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:59,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538044815] [2025-03-17 15:18:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538044815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189668789] [2025-03-17 15:18:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:59,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:59,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:59,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:59,359 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:59,394 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2025-03-17 15:18:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:59,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-03-17 15:18:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:59,396 INFO L225 Difference]: With dead ends: 111 [2025-03-17 15:18:59,396 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 15:18:59,396 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-17 15:18:59,396 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:59,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 155 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 15:18:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 15:18:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 102 states have internal predecessors, (104), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-17 15:18:59,411 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 37 [2025-03-17 15:18:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:59,412 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-17 15:18:59,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-17 15:18:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 15:18:59,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:59,413 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 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-17 15:18:59,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:18:59,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:59,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash 305637266, now seen corresponding path program 1 times [2025-03-17 15:18:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:59,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101994033] [2025-03-17 15:18:59,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:59,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 15:18:59,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:18:59,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:18:59,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101994033] [2025-03-17 15:18:59,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101994033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:59,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:18:59,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675905986] [2025-03-17 15:18:59,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:59,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:18:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:59,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:18:59,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:18:59,493 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:59,556 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2025-03-17 15:18:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:18:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-17 15:18:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:59,558 INFO L225 Difference]: With dead ends: 112 [2025-03-17 15:18:59,558 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 15:18:59,558 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-17 15:18:59,558 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:59,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 206 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:18:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 15:18:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 15:18:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 103 states have internal predecessors, (105), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2025-03-17 15:18:59,573 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 38 [2025-03-17 15:18:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:59,573 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2025-03-17 15:18:59,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2025-03-17 15:18:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 15:18:59,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:59,573 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 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-17 15:18:59,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:18:59,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:59,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 884820709, now seen corresponding path program 1 times [2025-03-17 15:18:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:59,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275170663] [2025-03-17 15:18:59,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:59,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:18:59,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:18:59,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655423144] [2025-03-17 15:18:59,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:59,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:59,594 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-17 15:18:59,596 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-17 15:18:59,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:18:59,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:18:59,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:59,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 15:18:59,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:18:59,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:18:59,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275170663] [2025-03-17 15:18:59,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655423144] [2025-03-17 15:18:59,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655423144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:59,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696266796] [2025-03-17 15:18:59,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:59,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:59,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:59,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:59,653 INFO L87 Difference]: Start difference. First operand 111 states and 115 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:59,703 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2025-03-17 15:18:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:59,704 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2025-03-17 15:18:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:59,704 INFO L225 Difference]: With dead ends: 147 [2025-03-17 15:18:59,704 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 15:18:59,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-17 15:18:59,705 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:59,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 184 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 15:18:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2025-03-17 15:18:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.536231884057971) internal successors, (106), 104 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:18:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2025-03-17 15:18:59,711 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 39 [2025-03-17 15:18:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:59,712 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2025-03-17 15:18:59,712 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2025-03-17 15:18:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 15:18:59,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:59,713 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 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-17 15:18:59,718 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-17 15:18:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:59,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:59,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1659638256, now seen corresponding path program 1 times [2025-03-17 15:18:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890565588] [2025-03-17 15:18:59,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:59,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:18:59,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:18:59,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:19:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890565588] [2025-03-17 15:19:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890565588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:19:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401776202] [2025-03-17 15:19:00,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:00,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:19:00,019 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-17 15:19:00,021 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-17 15:19:00,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:19:00,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:19:00,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:00,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:19:00,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:19:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:19:00,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:19:00,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401776202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:19:00,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:19:00,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-17 15:19:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235079534] [2025-03-17 15:19:00,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:19:00,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:19:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:00,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:19:00,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:19:00,421 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 15:19:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:01,402 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2025-03-17 15:19:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:19:01,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 40 [2025-03-17 15:19:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:01,404 INFO L225 Difference]: With dead ends: 147 [2025-03-17 15:19:01,404 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 15:19:01,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:19:01,405 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 123 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:01,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 632 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 332 Invalid, 2 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 15:19:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 15:19:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 113. [2025-03-17 15:19:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 105 states have internal predecessors, (107), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:19:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2025-03-17 15:19:01,411 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 40 [2025-03-17 15:19:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:01,411 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2025-03-17 15:19:01,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 15:19:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2025-03-17 15:19:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:19:01,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:01,412 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 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-17 15:19:01,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:19:01,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:01,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1479498830, now seen corresponding path program 1 times [2025-03-17 15:19:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698356354] [2025-03-17 15:19:01,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:01,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:19:01,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:19:01,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:01,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:19:01,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312717210] [2025-03-17 15:19:01,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:01,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:01,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:19:01,633 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-17 15:19:01,634 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-17 15:19:01,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:19:01,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:19:01,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:01,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:01,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:19:01,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:19:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:19:01,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:19:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:19:01,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698356354] [2025-03-17 15:19:01,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:19:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312717210] [2025-03-17 15:19:01,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312717210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:19:01,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:19:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 15:19:01,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600496209] [2025-03-17 15:19:01,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:19:01,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:19:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:01,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:19:01,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:19:01,919 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:19:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:02,643 INFO L93 Difference]: Finished difference Result 187 states and 211 transitions. [2025-03-17 15:19:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:19:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2025-03-17 15:19:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:02,645 INFO L225 Difference]: With dead ends: 187 [2025-03-17 15:19:02,645 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 15:19:02,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:19:02,646 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 163 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:02,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 290 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:19:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 15:19:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2025-03-17 15:19:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 145 states have internal predecessors, (174), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:19:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 186 transitions. [2025-03-17 15:19:02,657 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 186 transitions. Word has length 42 [2025-03-17 15:19:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:02,658 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 186 transitions. [2025-03-17 15:19:02,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:19:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 186 transitions. [2025-03-17 15:19:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:19:02,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:02,658 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:19:02,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:19:02,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:02,863 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash 164202156, now seen corresponding path program 1 times [2025-03-17 15:19:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816700059] [2025-03-17 15:19:02,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:02,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:19:02,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:19:02,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:02,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:19:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427205656] [2025-03-17 15:19:02,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:02,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:19:02,876 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-17 15:19:02,877 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-17 15:19:02,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:19:02,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:19:02,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:02,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:02,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:19:02,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:19:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:02,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:19:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816700059] [2025-03-17 15:19:02,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:19:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427205656] [2025-03-17 15:19:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427205656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:02,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:02,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:19:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104598915] [2025-03-17 15:19:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:19:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:02,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:19:02,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:19:02,924 INFO L87 Difference]: Start difference. First operand 154 states and 186 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:19:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:03,012 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2025-03-17 15:19:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:19:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-03-17 15:19:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:03,014 INFO L225 Difference]: With dead ends: 266 [2025-03-17 15:19:03,014 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 15:19:03,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-17 15:19:03,015 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:03,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 15:19:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2025-03-17 15:19:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.40625) internal successors, (270), 218 states have internal predecessors, (270), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 286 transitions. [2025-03-17 15:19:03,026 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 286 transitions. Word has length 44 [2025-03-17 15:19:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 286 transitions. [2025-03-17 15:19:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:19:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 286 transitions. [2025-03-17 15:19:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:19:03,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:03,026 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:19:03,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:19:03,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:03,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1134214529, now seen corresponding path program 1 times [2025-03-17 15:19:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629029481] [2025-03-17 15:19:03,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:19:03,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:19:03,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:03,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:03,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:03,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629029481] [2025-03-17 15:19:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629029481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:03,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:19:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740202433] [2025-03-17 15:19:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:03,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:19:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:03,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:19:03,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:19:03,293 INFO L87 Difference]: Start difference. First operand 229 states and 286 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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-17 15:19:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:03,405 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2025-03-17 15:19:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:19:03,405 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), 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 62 [2025-03-17 15:19:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:03,407 INFO L225 Difference]: With dead ends: 238 [2025-03-17 15:19:03,407 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 15:19:03,408 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-17 15:19:03,408 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:03,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 197 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 15:19:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2025-03-17 15:19:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 218 states have internal predecessors, (268), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 284 transitions. [2025-03-17 15:19:03,417 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 284 transitions. Word has length 62 [2025-03-17 15:19:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:03,418 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 284 transitions. [2025-03-17 15:19:03,418 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), 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-17 15:19:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 284 transitions. [2025-03-17 15:19:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:19:03,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:03,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:19:03,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:19:03,419 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:03,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1134214568, now seen corresponding path program 1 times [2025-03-17 15:19:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:03,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264967122] [2025-03-17 15:19:03,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:03,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:19:03,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:19:03,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:03,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:03,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:03,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264967122] [2025-03-17 15:19:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264967122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:19:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056836213] [2025-03-17 15:19:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:03,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:19:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:03,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:19:03,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:03,475 INFO L87 Difference]: Start difference. First operand 229 states and 284 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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-17 15:19:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:03,571 INFO L93 Difference]: Finished difference Result 229 states and 284 transitions. [2025-03-17 15:19:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:19:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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 62 [2025-03-17 15:19:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:03,572 INFO L225 Difference]: With dead ends: 229 [2025-03-17 15:19:03,572 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 15:19:03,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:19:03,573 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 100 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:03,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 171 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 15:19:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-03-17 15:19:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.375) internal successors, (264), 217 states have internal predecessors, (264), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2025-03-17 15:19:03,582 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 62 [2025-03-17 15:19:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:03,582 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2025-03-17 15:19:03,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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-17 15:19:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2025-03-17 15:19:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 15:19:03,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:03,582 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:19:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:19:03,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:03,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 800912039, now seen corresponding path program 1 times [2025-03-17 15:19:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:03,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037168390] [2025-03-17 15:19:03,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:03,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:19:03,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:19:03,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:03,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:03,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:03,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037168390] [2025-03-17 15:19:03,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037168390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:03,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:03,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:19:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978366816] [2025-03-17 15:19:03,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:03,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:19:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:03,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:19:03,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:03,659 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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-17 15:19:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:03,811 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2025-03-17 15:19:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:19:03,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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 63 [2025-03-17 15:19:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:03,813 INFO L225 Difference]: With dead ends: 232 [2025-03-17 15:19:03,813 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 15:19:03,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:19:03,813 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 119 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:03,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 163 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 15:19:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2025-03-17 15:19:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.3645833333333333) internal successors, (262), 217 states have internal predecessors, (262), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 278 transitions. [2025-03-17 15:19:03,824 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 278 transitions. Word has length 63 [2025-03-17 15:19:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:03,825 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 278 transitions. [2025-03-17 15:19:03,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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-17 15:19:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 278 transitions. [2025-03-17 15:19:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 15:19:03,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:03,826 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:19:03,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:19:03,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:03,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash 800913256, now seen corresponding path program 1 times [2025-03-17 15:19:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:03,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166654724] [2025-03-17 15:19:03,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:03,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:03,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:19:03,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:19:03,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:03,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166654724] [2025-03-17 15:19:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166654724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:19:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835264564] [2025-03-17 15:19:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:03,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:19:03,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:03,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:19:03,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:19:03,875 INFO L87 Difference]: Start difference. First operand 228 states and 278 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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-17 15:19:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:03,972 INFO L93 Difference]: Finished difference Result 238 states and 288 transitions. [2025-03-17 15:19:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:19:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 63 [2025-03-17 15:19:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:03,973 INFO L225 Difference]: With dead ends: 238 [2025-03-17 15:19:03,973 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 15:19:03,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:03,974 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:03,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 160 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 15:19:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2025-03-17 15:19:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 192 states have (on average 1.34375) internal successors, (258), 216 states have internal predecessors, (258), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 274 transitions. [2025-03-17 15:19:03,985 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 274 transitions. Word has length 63 [2025-03-17 15:19:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:03,985 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 274 transitions. [2025-03-17 15:19:03,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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-17 15:19:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 274 transitions. [2025-03-17 15:19:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:19:03,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:03,987 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:19:03,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:19:03,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1427230518, now seen corresponding path program 1 times [2025-03-17 15:19:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770221748] [2025-03-17 15:19:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:03,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:19:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:19:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:04,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:04,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770221748] [2025-03-17 15:19:04,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770221748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:19:04,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968299013] [2025-03-17 15:19:04,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:04,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:04,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:19:04,077 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-17 15:19:04,079 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-17 15:19:04,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:19:04,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:19:04,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:04,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:04,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:19:04,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:19:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:04,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:19:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968299013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:19:04,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:19:04,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-17 15:19:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87241195] [2025-03-17 15:19:04,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:19:04,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:19:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:04,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:19:04,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:19:04,319 INFO L87 Difference]: Start difference. First operand 227 states and 274 transitions. Second operand has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 14 states have internal predecessors, (118), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-17 15:19:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:04,787 INFO L93 Difference]: Finished difference Result 293 states and 362 transitions. [2025-03-17 15:19:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:19:04,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 14 states have internal predecessors, (118), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 66 [2025-03-17 15:19:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:04,789 INFO L225 Difference]: With dead ends: 293 [2025-03-17 15:19:04,789 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 15:19:04,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:19:04,790 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 452 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:04,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 297 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:19:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 15:19:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 234. [2025-03-17 15:19:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.3366834170854272) internal successors, (266), 223 states have internal predecessors, (266), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2025-03-17 15:19:04,798 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 66 [2025-03-17 15:19:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:04,798 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2025-03-17 15:19:04,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 14 states have internal predecessors, (118), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-17 15:19:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2025-03-17 15:19:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:19:04,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:04,799 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:19:04,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 15:19:04,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 15:19:05,000 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:05,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1463494101, now seen corresponding path program 1 times [2025-03-17 15:19:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:05,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816432575] [2025-03-17 15:19:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:05,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:19:05,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:19:05,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:05,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:05,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816432575] [2025-03-17 15:19:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816432575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:05,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:19:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858537353] [2025-03-17 15:19:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:05,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:19:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:19:05,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:05,057 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-17 15:19:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:05,143 INFO L93 Difference]: Finished difference Result 236 states and 286 transitions. [2025-03-17 15:19:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:19:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 66 [2025-03-17 15:19:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:05,144 INFO L225 Difference]: With dead ends: 236 [2025-03-17 15:19:05,144 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 15:19:05,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:19:05,145 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:05,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 165 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 15:19:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2025-03-17 15:19:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 198 states have (on average 1.3181818181818181) internal successors, (261), 221 states have internal predecessors, (261), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 277 transitions. [2025-03-17 15:19:05,154 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 277 transitions. Word has length 66 [2025-03-17 15:19:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:05,154 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 277 transitions. [2025-03-17 15:19:05,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-17 15:19:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 277 transitions. [2025-03-17 15:19:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 15:19:05,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:05,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:19:05,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 15:19:05,155 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:05,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1294473155, now seen corresponding path program 1 times [2025-03-17 15:19:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138137842] [2025-03-17 15:19:05,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:05,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:19:05,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:19:05,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:05,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:05,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138137842] [2025-03-17 15:19:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138137842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:19:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470911336] [2025-03-17 15:19:05,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:05,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:05,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:19:05,214 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-17 15:19:05,215 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-17 15:19:05,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:19:05,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:19:05,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:05,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:05,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:19:05,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:19:23,253 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_45| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_45| |v_ULTIMATE.start_main_~R~0#1_45|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2025-03-17 15:19:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2025-03-17 15:19:23,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:19:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:23,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470911336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:19:23,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:19:23,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 15:19:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80486148] [2025-03-17 15:19:23,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:19:23,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:19:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:23,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:19:23,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2025-03-17 15:19:23,355 INFO L87 Difference]: Start difference. First operand 232 states and 277 transitions. Second operand has 14 states, 13 states have (on average 8.461538461538462) internal successors, (110), 14 states have internal predecessors, (110), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 15:19:35,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:40,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:45,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:49,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:53,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:59,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:03,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:08,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:14,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:18,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:20,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:24,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:28,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:32,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:37,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:41,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]