./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:59:48,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:59:48,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:59:48,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:59:48,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:59:48,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:59:48,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:59:48,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:59:48,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:59:48,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:59:48,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:59:48,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:59:48,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:59:48,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:59:48,836 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:59:48,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:59:48,837 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:59:48,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:59:48,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:59:48,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:59:48,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:59:48,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:59:48,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:59:48,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:59:48,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:59:48,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:59:48,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:59:48,840 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 -> a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 [2025-03-04 10:59:49,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:59:49,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:59:49,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:59:49,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:59:49,061 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:59:49,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2025-03-04 10:59:50,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb86a36a/b796c2ee35c84ac4bc99c1f92d9b6bb0/FLAGb325751f5 [2025-03-04 10:59:50,370 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:59:50,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2025-03-04 10:59:50,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb86a36a/b796c2ee35c84ac4bc99c1f92d9b6bb0/FLAGb325751f5 [2025-03-04 10:59:50,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb86a36a/b796c2ee35c84ac4bc99c1f92d9b6bb0 [2025-03-04 10:59:50,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:59:50,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:59:50,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:59:50,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:59:50,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:59:50,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2061303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50, skipping insertion in model container [2025-03-04 10:59:50,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:59:50,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:59:50,530 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:59:50,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:59:50,553 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:59:50,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50 WrapperNode [2025-03-04 10:59:50,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:59:50,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:59:50,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:59:50,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:59:50,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,592 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-03-04 10:59:50,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:59:50,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:59:50,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:59:50,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:59:50,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:59:50,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:59:50,641 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:59:50,641 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:59:50,641 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:59:50,642 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (1/1) ... [2025-03-04 10:59:50,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:59:50,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:50,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:59:50,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:59:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:59:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 10:59:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 10:59:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:59:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:59:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:59:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:59:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:59:50,726 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:59:50,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:59:51,094 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-04 10:59:51,094 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:59:51,104 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:59:51,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:59:51,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:59:51 BoogieIcfgContainer [2025-03-04 10:59:51,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:59:51,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:59:51,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:59:51,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:59:51,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:59:50" (1/3) ... [2025-03-04 10:59:51,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edd0e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:59:51, skipping insertion in model container [2025-03-04 10:59:51,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:59:50" (2/3) ... [2025-03-04 10:59:51,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edd0e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:59:51, skipping insertion in model container [2025-03-04 10:59:51,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:59:51" (3/3) ... [2025-03-04 10:59:51,111 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound1.c [2025-03-04 10:59:51,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:59:51,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound1.c that has 3 procedures, 227 locations, 1 initial locations, 3 loop locations, and 98 error locations. [2025-03-04 10:59:51,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:59:51,176 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;@6c435046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:59:51,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-03-04 10:59:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 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-04 10:59:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 10:59:51,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:51,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 10:59:51,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 252190, now seen corresponding path program 1 times [2025-03-04 10:59:51,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:51,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287979830] [2025-03-04 10:59:51,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:51,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:51,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:59:51,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:59:51,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:51,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:59:51,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:51,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287979830] [2025-03-04 10:59:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287979830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:51,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:59:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378588974] [2025-03-04 10:59:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:59:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:51,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:59:51,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:51,321 INFO L87 Difference]: Start difference. First operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:59:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:51,402 INFO L93 Difference]: Finished difference Result 427 states and 471 transitions. [2025-03-04 10:59:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:59:51,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 10:59:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:51,408 INFO L225 Difference]: With dead ends: 427 [2025-03-04 10:59:51,409 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 10:59:51,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:51,414 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:51,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 394 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 10:59:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 10:59:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 115 states have (on average 1.7739130434782608) internal successors, (204), 198 states have internal predecessors, (204), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:59:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 214 transitions. [2025-03-04 10:59:51,455 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 214 transitions. Word has length 3 [2025-03-04 10:59:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:51,456 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 214 transitions. [2025-03-04 10:59:51,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:59:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 214 transitions. [2025-03-04 10:59:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:59:51,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:51,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:59:51,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:59:51,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:51,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 7818079, now seen corresponding path program 1 times [2025-03-04 10:59:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485859778] [2025-03-04 10:59:51,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:51,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:59:51,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:59:51,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:51,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:59:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485859778] [2025-03-04 10:59:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485859778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:51,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:51,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:59:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943503522] [2025-03-04 10:59:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:51,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:59:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:51,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:59:51,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:51,498 INFO L87 Difference]: Start difference. First operand 206 states and 214 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:59:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:51,553 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2025-03-04 10:59:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:59:51,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 10:59:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:51,555 INFO L225 Difference]: With dead ends: 206 [2025-03-04 10:59:51,555 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 10:59:51,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:51,555 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 12 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:51,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 10:59:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-04 10:59:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 194 states have internal predecessors, (200), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:59:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 210 transitions. [2025-03-04 10:59:51,573 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 210 transitions. Word has length 4 [2025-03-04 10:59:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:51,573 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 210 transitions. [2025-03-04 10:59:51,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:59:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 210 transitions. [2025-03-04 10:59:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:59:51,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:51,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:51,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:59:51,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:51,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash 325866139, now seen corresponding path program 1 times [2025-03-04 10:59:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000475402] [2025-03-04 10:59:51,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:51,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:59:51,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:59:51,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:51,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:59:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620018792] [2025-03-04 10:59:51,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:51,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:51,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:51,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:59:51,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:59:51,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:59:51,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:59:51,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:51,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:51,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:59:51,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:59:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:59:51,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:59:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000475402] [2025-03-04 10:59:51,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:59:51,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620018792] [2025-03-04 10:59:51,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620018792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:51,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:51,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:59:51,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014533568] [2025-03-04 10:59:51,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:51,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:59:51,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:51,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:59:51,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:51,683 INFO L87 Difference]: Start difference. First operand 202 states and 210 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:59:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:51,710 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2025-03-04 10:59:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:59:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:59:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:51,713 INFO L225 Difference]: With dead ends: 202 [2025-03-04 10:59:51,714 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 10:59:51,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:51,715 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 8 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:51,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 381 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 10:59:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-04 10:59:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 115 states have (on average 1.7217391304347827) internal successors, (198), 192 states have internal predecessors, (198), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:59:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 208 transitions. [2025-03-04 10:59:51,732 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 208 transitions. Word has length 8 [2025-03-04 10:59:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:51,732 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 208 transitions. [2025-03-04 10:59:51,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:59:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 208 transitions. [2025-03-04 10:59:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:59:51,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:51,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:51,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:59:51,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:51,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:51,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1205435852, now seen corresponding path program 1 times [2025-03-04 10:59:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:51,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834767570] [2025-03-04 10:59:51,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:51,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:59:51,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:59:51,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:51,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:59:51,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964598424] [2025-03-04 10:59:51,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:51,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:59:51,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:59:52,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:59:52,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:59:52,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:52,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:52,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:59:52,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:59:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:52,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:59:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834767570] [2025-03-04 10:59:52,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:59:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964598424] [2025-03-04 10:59:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964598424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:59:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920861057] [2025-03-04 10:59:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:59:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:52,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:59:52,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:52,049 INFO L87 Difference]: Start difference. First operand 200 states and 208 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:52,091 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2025-03-04 10:59:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:59:52,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-04 10:59:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:52,093 INFO L225 Difference]: With dead ends: 200 [2025-03-04 10:59:52,093 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 10:59:52,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:52,095 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 162 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:52,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 188 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 10:59:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-04 10:59:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 190 states have internal predecessors, (196), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:59:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 206 transitions. [2025-03-04 10:59:52,107 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 206 transitions. Word has length 25 [2025-03-04 10:59:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:52,108 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 206 transitions. [2025-03-04 10:59:52,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 206 transitions. [2025-03-04 10:59:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:59:52,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:52,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:52,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:59:52,313 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-04 10:59:52,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:52,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1286194415, now seen corresponding path program 1 times [2025-03-04 10:59:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013768714] [2025-03-04 10:59:52,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:52,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:59:52,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:59:52,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:52,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:59:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013768714] [2025-03-04 10:59:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013768714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:59:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783184089] [2025-03-04 10:59:52,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:52,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:52,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:59:52,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:59:52,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:59:52,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:59:52,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:52,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:52,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:59:52,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:59:52,631 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-04 10:59:52,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:59:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783184089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:52,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:59:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:59:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611992660] [2025-03-04 10:59:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:52,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:59:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:52,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:59:52,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:59:52,635 INFO L87 Difference]: Start difference. First operand 198 states and 206 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, (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-04 10:59:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:52,744 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2025-03-04 10:59:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:59:52,745 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, (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 26 [2025-03-04 10:59:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:52,746 INFO L225 Difference]: With dead ends: 198 [2025-03-04 10:59:52,746 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 10:59:52,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:59:52,746 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 161 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:52,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 675 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:59:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 10:59:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-04 10:59:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 115 states have (on average 1.6869565217391305) internal successors, (194), 188 states have internal predecessors, (194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:59:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2025-03-04 10:59:52,759 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 26 [2025-03-04 10:59:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2025-03-04 10:59:52,759 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, (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-04 10:59:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2025-03-04 10:59:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:59:52,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:52,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:52,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:59:52,964 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-04 10:59:52,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:52,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -917743283, now seen corresponding path program 1 times [2025-03-04 10:59:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:52,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912710111] [2025-03-04 10:59:52,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:52,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:59:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:59:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912710111] [2025-03-04 10:59:53,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912710111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:53,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:53,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:59:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964706155] [2025-03-04 10:59:53,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:53,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:59:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:53,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:59:53,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:59:53,014 INFO L87 Difference]: Start difference. First operand 196 states and 204 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:53,043 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2025-03-04 10:59:53,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:59:53,043 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:59:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:53,044 INFO L225 Difference]: With dead ends: 275 [2025-03-04 10:59:53,044 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 10:59:53,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:59:53,045 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 84 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:53,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 567 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 10:59:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 223. [2025-03-04 10:59:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6928571428571428) internal successors, (237), 214 states have internal predecessors, (237), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:59:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2025-03-04 10:59:53,052 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 28 [2025-03-04 10:59:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:53,052 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2025-03-04 10:59:53,052 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2025-03-04 10:59:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:59:53,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:53,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:53,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:59:53,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:53,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1614729456, now seen corresponding path program 1 times [2025-03-04 10:59:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974958639] [2025-03-04 10:59:53,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:53,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:59:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:59:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:53,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:53,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974958639] [2025-03-04 10:59:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974958639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:53,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:59:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363604127] [2025-03-04 10:59:53,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:59:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:53,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:59:53,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:59:53,111 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:53,138 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2025-03-04 10:59:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:59:53,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-04 10:59:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:53,140 INFO L225 Difference]: With dead ends: 252 [2025-03-04 10:59:53,140 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 10:59:53,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:59:53,141 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:53,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 570 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 10:59:53,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 10:59:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6785714285714286) internal successors, (235), 214 states have internal predecessors, (235), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:59:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2025-03-04 10:59:53,150 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 29 [2025-03-04 10:59:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:53,150 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2025-03-04 10:59:53,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2025-03-04 10:59:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:59:53,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:53,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:53,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:59:53,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1271818318, now seen corresponding path program 1 times [2025-03-04 10:59:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316618620] [2025-03-04 10:59:53,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:53,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:59:53,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:59:53,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:53,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:53,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:53,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316618620] [2025-03-04 10:59:53,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316618620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:53,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:53,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:59:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851549518] [2025-03-04 10:59:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:53,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:59:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:53,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:59:53,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:53,194 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:53,248 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2025-03-04 10:59:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:59:53,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-04 10:59:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:53,250 INFO L225 Difference]: With dead ends: 275 [2025-03-04 10:59:53,250 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 10:59:53,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:53,250 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 141 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:53,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 274 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 10:59:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2025-03-04 10:59:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 155 states have (on average 1.664516129032258) internal successors, (258), 229 states have internal predecessors, (258), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:59:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2025-03-04 10:59:53,257 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 31 [2025-03-04 10:59:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:53,258 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2025-03-04 10:59:53,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2025-03-04 10:59:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:59:53,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:53,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:53,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:59:53,258 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 771662345, now seen corresponding path program 1 times [2025-03-04 10:59:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439191044] [2025-03-04 10:59:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:53,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:59:53,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:59:53,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:53,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439191044] [2025-03-04 10:59:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439191044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:59:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739700427] [2025-03-04 10:59:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:53,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:59:53,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:53,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:59:53,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:59:53,299 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:53,393 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2025-03-04 10:59:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:59:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 10:59:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:53,395 INFO L225 Difference]: With dead ends: 278 [2025-03-04 10:59:53,396 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 10:59:53,396 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-04 10:59:53,396 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 151 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:53,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 431 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:59:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 10:59:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 241. [2025-03-04 10:59:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 232 states have internal predecessors, (260), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:59:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-03-04 10:59:53,407 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 32 [2025-03-04 10:59:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:53,407 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-03-04 10:59:53,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-03-04 10:59:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:59:53,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:53,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:53,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:59:53,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:53,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:53,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1848270932, now seen corresponding path program 1 times [2025-03-04 10:59:53,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:53,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470490050] [2025-03-04 10:59:53,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:53,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:53,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:59:53,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:59:53,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:53,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:59:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997904319] [2025-03-04 10:59:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:53,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:53,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:53,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:59:53,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:59:53,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:59:53,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:59:53,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:53,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:53,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:59:53,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:59:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:53,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:59:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470490050] [2025-03-04 10:59:53,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:59:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997904319] [2025-03-04 10:59:53,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997904319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:53,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:53,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:59:53,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057158179] [2025-03-04 10:59:53,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:53,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:59:53,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:53,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:59:53,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:53,503 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:53,611 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2025-03-04 10:59:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:59:53,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-04 10:59:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:53,613 INFO L225 Difference]: With dead ends: 390 [2025-03-04 10:59:53,613 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 10:59:53,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:53,614 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:53,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 368 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:59:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 10:59:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 313. [2025-03-04 10:59:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 227 states have (on average 1.669603524229075) internal successors, (379), 301 states have internal predecessors, (379), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:59:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 397 transitions. [2025-03-04 10:59:53,628 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 397 transitions. Word has length 33 [2025-03-04 10:59:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:53,628 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 397 transitions. [2025-03-04 10:59:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 397 transitions. [2025-03-04 10:59:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 10:59:53,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:53,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:53,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:59:53,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:53,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1461823897, now seen corresponding path program 1 times [2025-03-04 10:59:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316989436] [2025-03-04 10:59:53,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:53,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:59:53,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:59:53,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:53,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:59:53,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:53,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316989436] [2025-03-04 10:59:53,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316989436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:59:53,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837935988] [2025-03-04 10:59:53,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:53,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:53,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:53,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:59:53,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:59:53,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:59:53,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:59:53,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:53,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:53,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:59:53,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:59:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:59:54,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:59:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:59:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837935988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:59:54,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:59:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:59:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12238121] [2025-03-04 10:59:54,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:59:54,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:59:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:54,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:59:54,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:59:54,314 INFO L87 Difference]: Start difference. First operand 313 states and 397 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:59:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:54,614 INFO L93 Difference]: Finished difference Result 430 states and 471 transitions. [2025-03-04 10:59:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:59:54,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-03-04 10:59:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:54,616 INFO L225 Difference]: With dead ends: 430 [2025-03-04 10:59:54,616 INFO L226 Difference]: Without dead ends: 427 [2025-03-04 10:59:54,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:59:54,617 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 689 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:54,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1091 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:59:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-04 10:59:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 319. [2025-03-04 10:59:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 233 states have (on average 1.648068669527897) internal successors, (384), 307 states have internal predecessors, (384), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:59:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 402 transitions. [2025-03-04 10:59:54,633 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 402 transitions. Word has length 34 [2025-03-04 10:59:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:54,633 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 402 transitions. [2025-03-04 10:59:54,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:59:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 402 transitions. [2025-03-04 10:59:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 10:59:54,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:54,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:54,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:59:54,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:59:54,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash -358454587, now seen corresponding path program 1 times [2025-03-04 10:59:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689189202] [2025-03-04 10:59:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:54,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:59:54,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:59:54,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:54,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:59:54,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153455535] [2025-03-04 10:59:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:54,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:54,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:59:54,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:59:54,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:59:54,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:59:54,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:54,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:59:54,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:59:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:59:55,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:59:55,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:55,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689189202] [2025-03-04 10:59:55,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:59:55,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153455535] [2025-03-04 10:59:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153455535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:59:55,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:59:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:59:55,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273682626] [2025-03-04 10:59:55,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:59:55,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:59:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:55,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:59:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:59:55,098 INFO L87 Difference]: Start difference. First operand 319 states and 402 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:59:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:57,302 INFO L93 Difference]: Finished difference Result 499 states and 616 transitions. [2025-03-04 10:59:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:59:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-03-04 10:59:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:57,305 INFO L225 Difference]: With dead ends: 499 [2025-03-04 10:59:57,305 INFO L226 Difference]: Without dead ends: 472 [2025-03-04 10:59:57,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:59:57,306 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 428 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:57,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 520 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 10:59:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-04 10:59:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 438. [2025-03-04 10:59:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 349 states have (on average 1.5501432664756447) internal successors, (541), 423 states have internal predecessors, (541), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:59:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 565 transitions. [2025-03-04 10:59:57,330 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 565 transitions. Word has length 36 [2025-03-04 10:59:57,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:57,330 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 565 transitions. [2025-03-04 10:59:57,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:59:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 565 transitions. [2025-03-04 10:59:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:59:57,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:57,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:57,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:59:57,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:57,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash -877469917, now seen corresponding path program 1 times [2025-03-04 10:59:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62250365] [2025-03-04 10:59:57,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:57,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:59:57,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:59:57,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:57,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:59:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040827272] [2025-03-04 10:59:57,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:57,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:57,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:59:57,542 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:59:57,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:59:57,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:59:57,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:59:57,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:57,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:57,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:59:57,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:59:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:57,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:59:57,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62250365] [2025-03-04 10:59:57,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:59:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040827272] [2025-03-04 10:59:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040827272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:59:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567309245] [2025-03-04 10:59:57,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:59:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:57,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:59:57,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:57,594 INFO L87 Difference]: Start difference. First operand 438 states and 565 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:57,754 INFO L93 Difference]: Finished difference Result 630 states and 798 transitions. [2025-03-04 10:59:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:59:57,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-03-04 10:59:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:57,756 INFO L225 Difference]: With dead ends: 630 [2025-03-04 10:59:57,757 INFO L226 Difference]: Without dead ends: 589 [2025-03-04 10:59:57,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:59:57,758 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 117 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:57,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 271 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:59:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-04 10:59:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 557. [2025-03-04 10:59:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 465 states have (on average 1.4903225806451612) internal successors, (693), 539 states have internal predecessors, (693), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:59:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 723 transitions. [2025-03-04 10:59:57,777 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 723 transitions. Word has length 38 [2025-03-04 10:59:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:57,778 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 723 transitions. [2025-03-04 10:59:57,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:59:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 723 transitions. [2025-03-04 10:59:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:59:57,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:57,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:57,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:59:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:59:57,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:57,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash -632926895, now seen corresponding path program 1 times [2025-03-04 10:59:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403922648] [2025-03-04 10:59:57,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:57,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:59:57,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:59:57,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:57,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:58,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403922648] [2025-03-04 10:59:58,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403922648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:58,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:59:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066370980] [2025-03-04 10:59:58,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:58,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:59:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:58,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:59:58,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:59:58,045 INFO L87 Difference]: Start difference. First operand 557 states and 723 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:58,111 INFO L93 Difference]: Finished difference Result 1076 states and 1409 transitions. [2025-03-04 10:59:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:59:58,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2025-03-04 10:59:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:58,114 INFO L225 Difference]: With dead ends: 1076 [2025-03-04 10:59:58,114 INFO L226 Difference]: Without dead ends: 568 [2025-03-04 10:59:58,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:59:58,115 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 22 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:58,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 942 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-04 10:59:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 562. [2025-03-04 10:59:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 470 states have (on average 1.4872340425531916) internal successors, (699), 543 states have internal predecessors, (699), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:59:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 729 transitions. [2025-03-04 10:59:58,133 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 729 transitions. Word has length 56 [2025-03-04 10:59:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:58,133 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 729 transitions. [2025-03-04 10:59:58,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 729 transitions. [2025-03-04 10:59:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 10:59:58,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:58,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:58,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:59:58,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:58,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1854102845, now seen corresponding path program 1 times [2025-03-04 10:59:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294118059] [2025-03-04 10:59:58,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:58,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:59:58,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:59:58,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:58,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:58,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:58,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294118059] [2025-03-04 10:59:58,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294118059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:58,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:58,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:59:58,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123201385] [2025-03-04 10:59:58,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:58,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:59:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:58,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:59:58,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:59:58,180 INFO L87 Difference]: Start difference. First operand 562 states and 729 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:58,239 INFO L93 Difference]: Finished difference Result 626 states and 799 transitions. [2025-03-04 10:59:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:59:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2025-03-04 10:59:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:58,241 INFO L225 Difference]: With dead ends: 626 [2025-03-04 10:59:58,241 INFO L226 Difference]: Without dead ends: 625 [2025-03-04 10:59:58,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:59:58,242 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 78 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:58,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 772 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-04 10:59:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 566. [2025-03-04 10:59:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 546 states have internal predecessors, (697), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:59:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 727 transitions. [2025-03-04 10:59:58,267 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 727 transitions. Word has length 57 [2025-03-04 10:59:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:58,268 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 727 transitions. [2025-03-04 10:59:58,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 727 transitions. [2025-03-04 10:59:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:59:58,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:58,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:58,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:59:58,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1996431826, now seen corresponding path program 1 times [2025-03-04 10:59:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562512978] [2025-03-04 10:59:58,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:58,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:59:58,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:59:58,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:58,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562512978] [2025-03-04 10:59:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562512978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:58,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:58,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:59:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330736871] [2025-03-04 10:59:58,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:58,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:59:58,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:58,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:59:58,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:59:58,330 INFO L87 Difference]: Start difference. First operand 566 states and 727 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:59:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:58,382 INFO L93 Difference]: Finished difference Result 1112 states and 1451 transitions. [2025-03-04 10:59:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:59:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2025-03-04 10:59:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:58,384 INFO L225 Difference]: With dead ends: 1112 [2025-03-04 10:59:58,384 INFO L226 Difference]: Without dead ends: 600 [2025-03-04 10:59:58,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:59:58,387 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 10 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:58,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 779 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-04 10:59:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 582. [2025-03-04 10:59:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 489 states have (on average 1.456032719836401) internal successors, (712), 562 states have internal predecessors, (712), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:59:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 742 transitions. [2025-03-04 10:59:58,407 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 742 transitions. Word has length 60 [2025-03-04 10:59:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:58,408 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 742 transitions. [2025-03-04 10:59:58,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:59:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 742 transitions. [2025-03-04 10:59:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:59:58,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:58,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:58,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:59:58,409 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1759844407, now seen corresponding path program 1 times [2025-03-04 10:59:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:58,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554709072] [2025-03-04 10:59:58,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:58,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:59:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:59:58,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:58,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554709072] [2025-03-04 10:59:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554709072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:59:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074949504] [2025-03-04 10:59:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:58,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:59:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:58,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:59:58,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:59:58,464 INFO L87 Difference]: Start difference. First operand 582 states and 742 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:58,577 INFO L93 Difference]: Finished difference Result 720 states and 906 transitions. [2025-03-04 10:59:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:59:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2025-03-04 10:59:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:58,579 INFO L225 Difference]: With dead ends: 720 [2025-03-04 10:59:58,580 INFO L226 Difference]: Without dead ends: 719 [2025-03-04 10:59:58,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:59:58,580 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 133 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:58,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1133 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:59:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-04 10:59:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 624. [2025-03-04 10:59:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 528 states have (on average 1.4526515151515151) internal successors, (767), 601 states have internal predecessors, (767), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:59:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 801 transitions. [2025-03-04 10:59:58,602 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 801 transitions. Word has length 61 [2025-03-04 10:59:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:58,602 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 801 transitions. [2025-03-04 10:59:58,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 801 transitions. [2025-03-04 10:59:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:59:58,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:58,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:58,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:59:58,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:58,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1141110379, now seen corresponding path program 1 times [2025-03-04 10:59:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187865212] [2025-03-04 10:59:58,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:58,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:59:58,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:59:58,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:58,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:58,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187865212] [2025-03-04 10:59:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187865212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:59:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930297788] [2025-03-04 10:59:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:58,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:59:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:58,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:59:58,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:59:58,655 INFO L87 Difference]: Start difference. First operand 624 states and 801 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:59:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:58,683 INFO L93 Difference]: Finished difference Result 633 states and 811 transitions. [2025-03-04 10:59:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:59:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2025-03-04 10:59:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:58,684 INFO L225 Difference]: With dead ends: 633 [2025-03-04 10:59:58,684 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 10:59:58,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:59:58,685 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:58,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 211 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 10:59:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 10:59:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.0) internal successors, (56), 56 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:59:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2025-03-04 10:59:58,689 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 64 [2025-03-04 10:59:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:58,689 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2025-03-04 10:59:58,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:59:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2025-03-04 10:59:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 10:59:58,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:59:58,690 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:58,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:59:58,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 10:59:58,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:59:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1014683538, now seen corresponding path program 1 times [2025-03-04 10:59:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:59:58,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163251398] [2025-03-04 10:59:58,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:59:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:59:58,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 10:59:58,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:59:58,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:59:58,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:59:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:59:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:59:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163251398] [2025-03-04 10:59:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163251398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:59:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:59:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:59:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791388445] [2025-03-04 10:59:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:59:58,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:59:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:59:58,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:59:58,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:59:58,779 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:59:58,872 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2025-03-04 10:59:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:59:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2025-03-04 10:59:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:59:58,872 INFO L225 Difference]: With dead ends: 62 [2025-03-04 10:59:58,872 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:59:58,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:59:58,873 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:59:58,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 224 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:59:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:59:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:59:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:59:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:59:58,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2025-03-04 10:59:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:59:58,874 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:59:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:59:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:59:58,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:59:58,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2025-03-04 10:59:58,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2025-03-04 10:59:58,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2025-03-04 10:59:58,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2025-03-04 10:59:58,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2025-03-04 10:59:58,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2025-03-04 10:59:58,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2025-03-04 10:59:58,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2025-03-04 10:59:58,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2025-03-04 10:59:58,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2025-03-04 10:59:58,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2025-03-04 10:59:58,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2025-03-04 10:59:58,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2025-03-04 10:59:58,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2025-03-04 10:59:58,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2025-03-04 10:59:58,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2025-03-04 10:59:58,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2025-03-04 10:59:58,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:59:58,886 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:59:58,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:59:59,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:59:59,283 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,285 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,287 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,287 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,288 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,288 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:59:59,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:59:59 BoogieIcfgContainer [2025-03-04 10:59:59,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:59:59,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:59:59,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:59:59,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:59:59,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:59:51" (3/4) ... [2025-03-04 10:59:59,295 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:59:59,299 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 10:59:59,299 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:59:59,304 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 10:59:59,304 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:59:59,304 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:59:59,304 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:59:59,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:59:59,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:59:59,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:59:59,377 INFO L158 Benchmark]: Toolchain (without parser) took 8971.20ms. Allocated memory is still 142.6MB. Free memory was 114.8MB in the beginning and 74.8MB in the end (delta: 40.1MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2025-03-04 10:59:59,378 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:59:59,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.03ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 103.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:59:59,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 101.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:59:59,378 INFO L158 Benchmark]: Boogie Preprocessor took 40.67ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:59:59,379 INFO L158 Benchmark]: IcfgBuilder took 463.41ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 71.4MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:59:59,379 INFO L158 Benchmark]: TraceAbstraction took 8186.93ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 83.0MB in the end (delta: -12.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:59:59,379 INFO L158 Benchmark]: Witness Printer took 83.33ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 74.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:59:59,380 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.03ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 103.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 101.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.67ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 463.41ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 71.4MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8186.93ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 83.0MB in the end (delta: -12.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.33ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 74.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 227 locations, 98 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2433 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2400 mSDsluCounter, 10172 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6884 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1979 IncrementalHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 3288 mSDtfsCounter, 1979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=624occurred in iteration=17, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 545 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 762 ConstructedInterpolants, 15 QuantifiedInterpolants, 2923 SizeOfPredicates, 2 NumberOfNonLiveVariables, 467 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 66/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 98 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 2)) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((2 <= counter) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (counter <= 3)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) || ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 1)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:59:59,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE