./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-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 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:05:08,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:05:08,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:05:08,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:05:08,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:05:08,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:05:08,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:05:08,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:05:08,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:05:08,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:05:08,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:05:08,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:05:08,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:05:08,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:05:08,252 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:05:08,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:05:08,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:05:08,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:05:08,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:05:08,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:05:08,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:05:08,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:05:08,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:05:08,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:05:08,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:05:08,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:05:08,255 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 -> 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 [2025-03-09 02:05:08,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:05:08,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:05:08,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:05:08,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:05:08,514 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:05:08,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2025-03-09 02:05:09,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf3873d3/cac0e0fb14594d9bacddb2fc7122ce7b/FLAG1af79b8e6 [2025-03-09 02:05:09,854 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:05:09,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2025-03-09 02:05:09,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf3873d3/cac0e0fb14594d9bacddb2fc7122ce7b/FLAG1af79b8e6 [2025-03-09 02:05:10,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf3873d3/cac0e0fb14594d9bacddb2fc7122ce7b [2025-03-09 02:05:10,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:05:10,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:05:10,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:05:10,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:05:10,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:05:10,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6a77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10, skipping insertion in model container [2025-03-09 02:05:10,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:05:10,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:05:10,333 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:05:10,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:05:10,371 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:05:10,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10 WrapperNode [2025-03-09 02:05:10,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:05:10,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:05:10,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:05:10,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:05:10,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,403 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-09 02:05:10,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:05:10,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:05:10,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:05:10,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:05:10,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,432 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:05:10,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:05:10,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:05:10,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:05:10,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:05:10,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (1/1) ... [2025-03-09 02:05:10,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:05:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:10,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:05:10,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:05:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:05:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:05:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:05:10,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:05:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:05:10,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:05:10,540 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:05:10,541 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:05:11,057 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-03-09 02:05:11,057 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:05:11,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:05:11,078 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:05:11,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:05:11 BoogieIcfgContainer [2025-03-09 02:05:11,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:05:11,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:05:11,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:05:11,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:05:11,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:05:10" (1/3) ... [2025-03-09 02:05:11,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564c2687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:05:11, skipping insertion in model container [2025-03-09 02:05:11,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:05:10" (2/3) ... [2025-03-09 02:05:11,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564c2687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:05:11, skipping insertion in model container [2025-03-09 02:05:11,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:05:11" (3/3) ... [2025-03-09 02:05:11,086 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.c [2025-03-09 02:05:11,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:05:11,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound1.c that has 2 procedures, 306 locations, 1 initial locations, 1 loop locations, and 140 error locations. [2025-03-09 02:05:11,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:05:11,164 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;@23e6abf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:05:11,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 140 error locations. [2025-03-09 02:05:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:05:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 02:05:11,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:11,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 02:05:11,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:11,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash 10188447, now seen corresponding path program 1 times [2025-03-09 02:05:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:11,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118779510] [2025-03-09 02:05:11,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:11,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 02:05:11,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 02:05:11,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:11,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:05:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118779510] [2025-03-09 02:05:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118779510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:11,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:11,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912629331] [2025-03-09 02:05:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:11,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:11,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:11,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:11,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:11,380 INFO L87 Difference]: Start difference. First operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:05:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:11,497 INFO L93 Difference]: Finished difference Result 606 states and 654 transitions. [2025-03-09 02:05:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:05:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 02:05:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:11,504 INFO L225 Difference]: With dead ends: 606 [2025-03-09 02:05:11,505 INFO L226 Difference]: Without dead ends: 296 [2025-03-09 02:05:11,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:05:11,512 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 4 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:11,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 909 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-09 02:05:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-09 02:05:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 152 states have (on average 1.881578947368421) internal successors, (286), 284 states have internal predecessors, (286), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:05:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 306 transitions. [2025-03-09 02:05:11,560 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 306 transitions. Word has length 4 [2025-03-09 02:05:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:11,561 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 306 transitions. [2025-03-09 02:05:11,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:05:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 306 transitions. [2025-03-09 02:05:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:05:11,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:11,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:11,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:05:11,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:11,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1418391353, now seen corresponding path program 1 times [2025-03-09 02:05:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:11,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041063909] [2025-03-09 02:05:11,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:11,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:05:11,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:05:11,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:11,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:05:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041063909] [2025-03-09 02:05:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041063909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229747910] [2025-03-09 02:05:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:11,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:11,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:11,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:11,611 INFO L87 Difference]: Start difference. First operand 296 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:05:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:11,731 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2025-03-09 02:05:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:11,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:05:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:11,734 INFO L225 Difference]: With dead ends: 564 [2025-03-09 02:05:11,734 INFO L226 Difference]: Without dead ends: 544 [2025-03-09 02:05:11,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:11,738 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 237 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:11,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 581 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-09 02:05:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 354. [2025-03-09 02:05:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 205 states have (on average 1.7902439024390244) internal successors, (367), 337 states have internal predecessors, (367), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-09 02:05:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 397 transitions. [2025-03-09 02:05:11,761 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 397 transitions. Word has length 7 [2025-03-09 02:05:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:11,761 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 397 transitions. [2025-03-09 02:05:11,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:05:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 397 transitions. [2025-03-09 02:05:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:05:11,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:11,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:11,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:05:11,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:11,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1941662720, now seen corresponding path program 1 times [2025-03-09 02:05:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:11,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471129644] [2025-03-09 02:05:11,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:11,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:11,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:05:11,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:05:11,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:11,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485580110] [2025-03-09 02:05:11,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:11,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:11,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:11,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:05:11,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:05:11,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:05:11,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:11,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:11,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:05:11,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:05:11,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:05:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471129644] [2025-03-09 02:05:11,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485580110] [2025-03-09 02:05:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485580110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:11,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131731960] [2025-03-09 02:05:11,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:11,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:11,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:11,983 INFO L87 Difference]: Start difference. First operand 354 states and 397 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:12,438 INFO L93 Difference]: Finished difference Result 514 states and 572 transitions. [2025-03-09 02:05:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 40 [2025-03-09 02:05:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:12,443 INFO L225 Difference]: With dead ends: 514 [2025-03-09 02:05:12,443 INFO L226 Difference]: Without dead ends: 459 [2025-03-09 02:05:12,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:12,444 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 134 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:12,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 371 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:05:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-09 02:05:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 439. [2025-03-09 02:05:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.6491228070175439) internal successors, (470), 417 states have internal predecessors, (470), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-09 02:05:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 510 transitions. [2025-03-09 02:05:12,466 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 510 transitions. Word has length 40 [2025-03-09 02:05:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:12,466 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 510 transitions. [2025-03-09 02:05:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 510 transitions. [2025-03-09 02:05:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:05:12,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:12,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:12,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:12,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:12,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1922060450, now seen corresponding path program 1 times [2025-03-09 02:05:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331827891] [2025-03-09 02:05:12,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:12,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:05:12,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:05:12,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:12,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:05:12,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:12,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331827891] [2025-03-09 02:05:12,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331827891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:12,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123737233] [2025-03-09 02:05:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:12,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:12,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:12,763 INFO L87 Difference]: Start difference. First operand 439 states and 510 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:13,011 INFO L93 Difference]: Finished difference Result 472 states and 517 transitions. [2025-03-09 02:05:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:13,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 42 [2025-03-09 02:05:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:13,013 INFO L225 Difference]: With dead ends: 472 [2025-03-09 02:05:13,014 INFO L226 Difference]: Without dead ends: 449 [2025-03-09 02:05:13,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:13,014 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 120 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:13,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 487 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:05:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-09 02:05:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-09 02:05:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.568421052631579) internal successors, (447), 417 states have internal predecessors, (447), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-09 02:05:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 487 transitions. [2025-03-09 02:05:13,026 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 487 transitions. Word has length 42 [2025-03-09 02:05:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:13,026 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 487 transitions. [2025-03-09 02:05:13,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 487 transitions. [2025-03-09 02:05:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:05:13,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:13,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:13,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:05:13,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:13,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash -264148292, now seen corresponding path program 1 times [2025-03-09 02:05:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:13,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321831649] [2025-03-09 02:05:13,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:13,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:13,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:05:13,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:05:13,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:05:13,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321831649] [2025-03-09 02:05:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321831649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:05:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291413493] [2025-03-09 02:05:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:13,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:13,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:13,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:13,122 INFO L87 Difference]: Start difference. First operand 439 states and 487 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:13,585 INFO L93 Difference]: Finished difference Result 451 states and 494 transitions. [2025-03-09 02:05:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:05:13,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 44 [2025-03-09 02:05:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:13,587 INFO L225 Difference]: With dead ends: 451 [2025-03-09 02:05:13,587 INFO L226 Difference]: Without dead ends: 449 [2025-03-09 02:05:13,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:13,588 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 140 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:13,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 528 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:05:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-09 02:05:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-09 02:05:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.5614035087719298) internal successors, (445), 417 states have internal predecessors, (445), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-09 02:05:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 485 transitions. [2025-03-09 02:05:13,604 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 485 transitions. Word has length 44 [2025-03-09 02:05:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:13,604 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 485 transitions. [2025-03-09 02:05:13,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 485 transitions. [2025-03-09 02:05:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:05:13,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:13,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:05:13,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:13,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash 401337751, now seen corresponding path program 1 times [2025-03-09 02:05:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38982210] [2025-03-09 02:05:13,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:13,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:05:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:05:13,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:13,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:05:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38982210] [2025-03-09 02:05:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38982210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:13,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:13,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:05:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476904389] [2025-03-09 02:05:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:13,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:13,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:13,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:13,692 INFO L87 Difference]: Start difference. First operand 439 states and 485 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:13,994 INFO L93 Difference]: Finished difference Result 451 states and 492 transitions. [2025-03-09 02:05:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:05:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 45 [2025-03-09 02:05:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:13,996 INFO L225 Difference]: With dead ends: 451 [2025-03-09 02:05:13,996 INFO L226 Difference]: Without dead ends: 449 [2025-03-09 02:05:13,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:13,997 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 255 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:13,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 452 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:05:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-09 02:05:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-09 02:05:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.5543859649122806) internal successors, (443), 417 states have internal predecessors, (443), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-09 02:05:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 483 transitions. [2025-03-09 02:05:14,016 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 483 transitions. Word has length 45 [2025-03-09 02:05:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:14,016 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 483 transitions. [2025-03-09 02:05:14,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 483 transitions. [2025-03-09 02:05:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:05:14,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:14,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:14,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:05:14,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:14,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash -935804552, now seen corresponding path program 1 times [2025-03-09 02:05:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466565704] [2025-03-09 02:05:14,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:14,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:05:14,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:05:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1617638979] [2025-03-09 02:05:14,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:14,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:14,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:14,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:14,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:05:14,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:05:14,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:05:14,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:14,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:14,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:05:14,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:05:14,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:05:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466565704] [2025-03-09 02:05:14,254 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617638979] [2025-03-09 02:05:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617638979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:14,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696675872] [2025-03-09 02:05:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:14,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:14,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:14,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:14,255 INFO L87 Difference]: Start difference. First operand 439 states and 483 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:14,559 INFO L93 Difference]: Finished difference Result 456 states and 490 transitions. [2025-03-09 02:05:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:14,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (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 48 [2025-03-09 02:05:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:14,563 INFO L225 Difference]: With dead ends: 456 [2025-03-09 02:05:14,563 INFO L226 Difference]: Without dead ends: 447 [2025-03-09 02:05:14,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:14,564 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 112 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:14,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 283 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:05:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-09 02:05:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 442. [2025-03-09 02:05:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 288 states have (on average 1.5277777777777777) internal successors, (440), 420 states have internal predecessors, (440), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-09 02:05:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 480 transitions. [2025-03-09 02:05:14,582 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 480 transitions. Word has length 48 [2025-03-09 02:05:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:14,583 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 480 transitions. [2025-03-09 02:05:14,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 480 transitions. [2025-03-09 02:05:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:05:14,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:14,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:14,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:14,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 02:05:14,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1054830163, now seen corresponding path program 1 times [2025-03-09 02:05:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778544644] [2025-03-09 02:05:14,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:14,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:05:14,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:05:14,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:14,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:05:14,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:14,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778544644] [2025-03-09 02:05:14,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778544644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:14,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:14,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:05:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613729990] [2025-03-09 02:05:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:14,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:14,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:14,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:14,869 INFO L87 Difference]: Start difference. First operand 442 states and 480 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:15,239 INFO L93 Difference]: Finished difference Result 455 states and 481 transitions. [2025-03-09 02:05:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:05:15,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-09 02:05:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:15,241 INFO L225 Difference]: With dead ends: 455 [2025-03-09 02:05:15,241 INFO L226 Difference]: Without dead ends: 449 [2025-03-09 02:05:15,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:15,241 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:15,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 417 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:05:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-09 02:05:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 442. [2025-03-09 02:05:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 288 states have (on average 1.5069444444444444) internal successors, (434), 420 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-09 02:05:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 474 transitions. [2025-03-09 02:05:15,254 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 474 transitions. Word has length 49 [2025-03-09 02:05:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:15,254 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 474 transitions. [2025-03-09 02:05:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 474 transitions. [2025-03-09 02:05:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:05:15,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:15,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:15,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:05:15,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:15,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash -899125489, now seen corresponding path program 1 times [2025-03-09 02:05:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467559324] [2025-03-09 02:05:15,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:15,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:05:15,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:05:15,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:15,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:05:15,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:15,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467559324] [2025-03-09 02:05:15,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467559324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:15,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:15,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:05:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965382634] [2025-03-09 02:05:15,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:15,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:15,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:15,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:15,351 INFO L87 Difference]: Start difference. First operand 442 states and 474 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:15,795 INFO L93 Difference]: Finished difference Result 453 states and 475 transitions. [2025-03-09 02:05:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-09 02:05:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:15,796 INFO L225 Difference]: With dead ends: 453 [2025-03-09 02:05:15,797 INFO L226 Difference]: Without dead ends: 380 [2025-03-09 02:05:15,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:15,798 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 119 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:15,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 433 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:05:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-09 02:05:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-03-09 02:05:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 225 states have (on average 1.6222222222222222) internal successors, (365), 357 states have internal predecessors, (365), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:05:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 399 transitions. [2025-03-09 02:05:15,809 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 399 transitions. Word has length 53 [2025-03-09 02:05:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:15,810 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 399 transitions. [2025-03-09 02:05:15,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:05:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 399 transitions. [2025-03-09 02:05:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 02:05:15,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:15,813 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:15,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:05:15,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:15,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1828896756, now seen corresponding path program 1 times [2025-03-09 02:05:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066467609] [2025-03-09 02:05:15,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:15,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 02:05:15,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 02:05:15,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:15,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066467609] [2025-03-09 02:05:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066467609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832196132] [2025-03-09 02:05:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:15,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:15,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:15,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:15,877 INFO L87 Difference]: Start difference. First operand 376 states and 399 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:16,059 INFO L93 Difference]: Finished difference Result 376 states and 399 transitions. [2025-03-09 02:05:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-09 02:05:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:16,061 INFO L225 Difference]: With dead ends: 376 [2025-03-09 02:05:16,061 INFO L226 Difference]: Without dead ends: 369 [2025-03-09 02:05:16,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:16,061 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:16,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 159 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:05:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-09 02:05:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-09 02:05:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 225 states have (on average 1.5911111111111111) internal successors, (358), 350 states have internal predecessors, (358), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:05:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 392 transitions. [2025-03-09 02:05:16,068 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 392 transitions. Word has length 85 [2025-03-09 02:05:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:16,068 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 392 transitions. [2025-03-09 02:05:16,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 392 transitions. [2025-03-09 02:05:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:05:16,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:16,069 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:16,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:05:16,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:16,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash -861224441, now seen corresponding path program 1 times [2025-03-09 02:05:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:16,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910881345] [2025-03-09 02:05:16,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:16,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:05:16,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:05:16,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:16,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:16,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910881345] [2025-03-09 02:05:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910881345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:16,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:16,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794519762] [2025-03-09 02:05:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:16,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:16,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:16,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:16,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:16,116 INFO L87 Difference]: Start difference. First operand 369 states and 392 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:16,321 INFO L93 Difference]: Finished difference Result 376 states and 395 transitions. [2025-03-09 02:05:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-03-09 02:05:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:16,323 INFO L225 Difference]: With dead ends: 376 [2025-03-09 02:05:16,323 INFO L226 Difference]: Without dead ends: 375 [2025-03-09 02:05:16,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:16,324 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 24 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:16,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 428 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:05:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-09 02:05:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-03-09 02:05:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 227 states have (on average 1.5859030837004404) internal successors, (360), 352 states have internal predecessors, (360), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:05:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 394 transitions. [2025-03-09 02:05:16,334 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 394 transitions. Word has length 86 [2025-03-09 02:05:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:16,334 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 394 transitions. [2025-03-09 02:05:16,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 394 transitions. [2025-03-09 02:05:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 02:05:16,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:16,337 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:16,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:05:16,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:16,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1376228870, now seen corresponding path program 1 times [2025-03-09 02:05:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:16,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462102003] [2025-03-09 02:05:16,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:16,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 02:05:16,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:05:16,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:16,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:16,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462102003] [2025-03-09 02:05:16,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462102003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:16,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:16,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817825327] [2025-03-09 02:05:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:16,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:16,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:16,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:16,411 INFO L87 Difference]: Start difference. First operand 371 states and 394 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:05:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:16,480 INFO L93 Difference]: Finished difference Result 371 states and 394 transitions. [2025-03-09 02:05:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2025-03-09 02:05:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:16,483 INFO L225 Difference]: With dead ends: 371 [2025-03-09 02:05:16,483 INFO L226 Difference]: Without dead ends: 369 [2025-03-09 02:05:16,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:16,483 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 195 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:16,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 267 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-09 02:05:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-09 02:05:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 227 states have (on average 1.5682819383259912) internal successors, (356), 350 states have internal predecessors, (356), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:05:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 390 transitions. [2025-03-09 02:05:16,491 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 390 transitions. Word has length 88 [2025-03-09 02:05:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 390 transitions. [2025-03-09 02:05:16,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:05:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 390 transitions. [2025-03-09 02:05:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-09 02:05:16,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:16,493 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:16,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:05:16,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:16,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -286577856, now seen corresponding path program 1 times [2025-03-09 02:05:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761073934] [2025-03-09 02:05:16,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:16,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 02:05:16,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 02:05:16,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:16,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761073934] [2025-03-09 02:05:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761073934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:16,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:05:16,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864230348] [2025-03-09 02:05:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:05:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:16,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:05:16,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:05:16,552 INFO L87 Difference]: Start difference. First operand 369 states and 390 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:16,699 INFO L93 Difference]: Finished difference Result 373 states and 390 transitions. [2025-03-09 02:05:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:05:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2025-03-09 02:05:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:16,701 INFO L225 Difference]: With dead ends: 373 [2025-03-09 02:05:16,701 INFO L226 Difference]: Without dead ends: 369 [2025-03-09 02:05:16,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:05:16,702 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 48 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:16,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 738 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-09 02:05:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2025-03-09 02:05:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 225 states have (on average 1.5644444444444445) internal successors, (352), 348 states have internal predecessors, (352), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:05:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 386 transitions. [2025-03-09 02:05:16,710 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 386 transitions. Word has length 89 [2025-03-09 02:05:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:16,710 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 386 transitions. [2025-03-09 02:05:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 386 transitions. [2025-03-09 02:05:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 02:05:16,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:16,711 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:16,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:05:16,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:16,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:16,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1292008901, now seen corresponding path program 1 times [2025-03-09 02:05:16,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:16,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434025513] [2025-03-09 02:05:16,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:16,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:16,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 02:05:16,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:05:16,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:16,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:16,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434025513] [2025-03-09 02:05:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434025513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657061341] [2025-03-09 02:05:16,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:16,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:16,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:16,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:16,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:05:16,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 02:05:16,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:05:16,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:16,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:05:16,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:16,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:05:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657061341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:16,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:05:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153194053] [2025-03-09 02:05:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:05:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:16,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:05:16,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:05:16,943 INFO L87 Difference]: Start difference. First operand 367 states and 386 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:16,968 INFO L93 Difference]: Finished difference Result 367 states and 386 transitions. [2025-03-09 02:05:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:05:16,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 88 [2025-03-09 02:05:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:16,969 INFO L225 Difference]: With dead ends: 367 [2025-03-09 02:05:16,969 INFO L226 Difference]: Without dead ends: 366 [2025-03-09 02:05:16,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:05:16,970 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 223 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:16,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 856 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:05:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-09 02:05:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-09 02:05:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 225 states have (on average 1.56) internal successors, (351), 347 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:05:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 385 transitions. [2025-03-09 02:05:16,979 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 385 transitions. Word has length 88 [2025-03-09 02:05:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 385 transitions. [2025-03-09 02:05:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 385 transitions. [2025-03-09 02:05:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-09 02:05:16,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:16,980 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:16,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:17,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:17,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:17,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1397570531, now seen corresponding path program 1 times [2025-03-09 02:05:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:17,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293416496] [2025-03-09 02:05:17,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:17,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:17,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 02:05:17,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 02:05:17,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:17,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293416496] [2025-03-09 02:05:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293416496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757931163] [2025-03-09 02:05:17,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:17,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:17,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:17,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:05:17,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 02:05:17,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 02:05:17,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:17,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:17,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:05:17,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:17,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:05:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757931163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:17,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:17,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-09 02:05:17,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075680078] [2025-03-09 02:05:17,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:17,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:05:17,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:17,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:05:17,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:05:17,411 INFO L87 Difference]: Start difference. First operand 366 states and 385 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:17,472 INFO L93 Difference]: Finished difference Result 535 states and 557 transitions. [2025-03-09 02:05:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:05:17,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2025-03-09 02:05:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:17,474 INFO L225 Difference]: With dead ends: 535 [2025-03-09 02:05:17,474 INFO L226 Difference]: Without dead ends: 534 [2025-03-09 02:05:17,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:05:17,475 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 221 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:17,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1499 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:05:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-09 02:05:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2025-03-09 02:05:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 296 states have (on average 1.6283783783783783) internal successors, (482), 418 states have internal predecessors, (482), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:05:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 526 transitions. [2025-03-09 02:05:17,490 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 526 transitions. Word has length 89 [2025-03-09 02:05:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:17,491 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 526 transitions. [2025-03-09 02:05:17,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 526 transitions. [2025-03-09 02:05:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 02:05:17,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:17,492 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:17,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:05:17,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:05:17,693 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:17,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1259474975, now seen corresponding path program 1 times [2025-03-09 02:05:17,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:17,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886387006] [2025-03-09 02:05:17,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:17,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 02:05:17,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 02:05:17,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:17,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:17,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:17,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886387006] [2025-03-09 02:05:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886387006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:17,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705967622] [2025-03-09 02:05:17,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:17,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:17,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:17,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:17,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:05:17,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 02:05:17,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 02:05:17,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:17,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:17,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:05:17,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:17,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:05:17,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705967622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:17,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:05:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851715082] [2025-03-09 02:05:17,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:17,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:17,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:17,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:17,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:05:17,861 INFO L87 Difference]: Start difference. First operand 442 states and 526 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:17,948 INFO L93 Difference]: Finished difference Result 444 states and 526 transitions. [2025-03-09 02:05:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:05:17,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 91 [2025-03-09 02:05:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:17,951 INFO L225 Difference]: With dead ends: 444 [2025-03-09 02:05:17,951 INFO L226 Difference]: Without dead ends: 436 [2025-03-09 02:05:17,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:05:17,951 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 437 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:17,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 355 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-09 02:05:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-03-09 02:05:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 296 states have (on average 1.5945945945945945) internal successors, (472), 410 states have internal predecessors, (472), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:05:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 516 transitions. [2025-03-09 02:05:17,963 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 516 transitions. Word has length 91 [2025-03-09 02:05:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:17,963 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 516 transitions. [2025-03-09 02:05:17,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:05:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 516 transitions. [2025-03-09 02:05:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 02:05:17,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:17,965 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:17,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:18,165 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,SelfDestructingSolverStorable15 [2025-03-09 02:05:18,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:18,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:18,166 INFO L85 PathProgramCache]: Analyzing trace with hash -389018303, now seen corresponding path program 1 times [2025-03-09 02:05:18,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:18,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927432270] [2025-03-09 02:05:18,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:18,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:18,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 02:05:18,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 02:05:18,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:18,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:18,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927432270] [2025-03-09 02:05:18,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927432270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:18,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254021981] [2025-03-09 02:05:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:18,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:18,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:18,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:18,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:05:18,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 02:05:18,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 02:05:18,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:18,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:18,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:05:18,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:18,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254021981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:05:18,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:05:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:05:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799957839] [2025-03-09 02:05:18,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:05:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:18,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:05:18,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:05:18,420 INFO L87 Difference]: Start difference. First operand 434 states and 516 transitions. Second operand has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-09 02:05:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:18,563 INFO L93 Difference]: Finished difference Result 779 states and 948 transitions. [2025-03-09 02:05:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:05:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 92 [2025-03-09 02:05:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:18,566 INFO L225 Difference]: With dead ends: 779 [2025-03-09 02:05:18,566 INFO L226 Difference]: Without dead ends: 771 [2025-03-09 02:05:18,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:05:18,567 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 824 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:18,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 969 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-09 02:05:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 505. [2025-03-09 02:05:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 367 states have (on average 1.561307901907357) internal successors, (573), 476 states have internal predecessors, (573), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-09 02:05:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 627 transitions. [2025-03-09 02:05:18,580 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 627 transitions. Word has length 92 [2025-03-09 02:05:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:18,580 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 627 transitions. [2025-03-09 02:05:18,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-09 02:05:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 627 transitions. [2025-03-09 02:05:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 02:05:18,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:18,581 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:18,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:05:18,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:05:18,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:18,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -607411062, now seen corresponding path program 1 times [2025-03-09 02:05:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:18,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126065983] [2025-03-09 02:05:18,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:18,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 02:05:18,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 02:05:18,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:18,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:05:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126065983] [2025-03-09 02:05:18,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126065983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:05:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259311177] [2025-03-09 02:05:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:05:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:18,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:05:18,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:18,845 INFO L87 Difference]: Start difference. First operand 505 states and 627 transitions. Second operand has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:05:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:18,896 INFO L93 Difference]: Finished difference Result 505 states and 627 transitions. [2025-03-09 02:05:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 101 [2025-03-09 02:05:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:18,898 INFO L225 Difference]: With dead ends: 505 [2025-03-09 02:05:18,898 INFO L226 Difference]: Without dead ends: 503 [2025-03-09 02:05:18,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:05:18,899 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 170 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:18,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 252 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:05:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-09 02:05:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-09 02:05:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 367 states have (on average 1.550408719346049) internal successors, (569), 474 states have internal predecessors, (569), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-09 02:05:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2025-03-09 02:05:18,910 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 101 [2025-03-09 02:05:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:18,910 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2025-03-09 02:05:18,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:05:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2025-03-09 02:05:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 02:05:18,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:18,911 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:18,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:05:18,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:18,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1649873606, now seen corresponding path program 1 times [2025-03-09 02:05:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807463329] [2025-03-09 02:05:18,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:18,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 02:05:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 02:05:18,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:18,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817718320] [2025-03-09 02:05:18,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:18,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:18,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:18,930 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:18,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:05:18,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 02:05:18,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 02:05:18,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:18,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:18,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:05:18,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:19,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:20,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807463329] [2025-03-09 02:05:20,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817718320] [2025-03-09 02:05:20,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817718320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:20,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:20,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:05:20,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119937882] [2025-03-09 02:05:20,081 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:20,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:05:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:20,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:05:20,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:05:20,083 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:20,743 INFO L93 Difference]: Finished difference Result 714 states and 919 transitions. [2025-03-09 02:05:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:05:20,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 102 [2025-03-09 02:05:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:20,746 INFO L225 Difference]: With dead ends: 714 [2025-03-09 02:05:20,746 INFO L226 Difference]: Without dead ends: 708 [2025-03-09 02:05:20,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:05:20,747 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 193 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:20,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 448 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:05:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-03-09 02:05:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 652. [2025-03-09 02:05:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 506 states have (on average 1.6027667984189724) internal successors, (811), 614 states have internal predecessors, (811), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:05:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 885 transitions. [2025-03-09 02:05:20,763 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 885 transitions. Word has length 102 [2025-03-09 02:05:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 885 transitions. [2025-03-09 02:05:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 885 transitions. [2025-03-09 02:05:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 02:05:20,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:20,764 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:20,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:05:20,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:20,968 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:20,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 979995133, now seen corresponding path program 1 times [2025-03-09 02:05:20,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:20,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81994339] [2025-03-09 02:05:20,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:20,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 02:05:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 02:05:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:21,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81994339] [2025-03-09 02:05:21,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81994339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039367829] [2025-03-09 02:05:21,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:21,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:21,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:21,046 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:21,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:05:21,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 02:05:21,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 02:05:21,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:21,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:21,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:05:21,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:05:21,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039367829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:05:21,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:05:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2025-03-09 02:05:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192789398] [2025-03-09 02:05:21,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:05:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:05:21,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:05:21,275 INFO L87 Difference]: Start difference. First operand 652 states and 885 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 02:05:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:21,336 INFO L93 Difference]: Finished difference Result 741 states and 920 transitions. [2025-03-09 02:05:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:05:21,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-03-09 02:05:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:21,337 INFO L225 Difference]: With dead ends: 741 [2025-03-09 02:05:21,338 INFO L226 Difference]: Without dead ends: 252 [2025-03-09 02:05:21,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:05:21,338 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 318 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:21,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 665 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:05:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-09 02:05:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-09 02:05:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 237 states have internal predecessors, (239), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:05:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 263 transitions. [2025-03-09 02:05:21,348 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 263 transitions. Word has length 103 [2025-03-09 02:05:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:21,349 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 263 transitions. [2025-03-09 02:05:21,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 02:05:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 263 transitions. [2025-03-09 02:05:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 02:05:21,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:21,350 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:21,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:05:21,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:21,554 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 393525896, now seen corresponding path program 1 times [2025-03-09 02:05:21,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216331282] [2025-03-09 02:05:21,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:21,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 02:05:21,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 02:05:21,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:21,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:21,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672542930] [2025-03-09 02:05:21,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:21,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:21,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:05:21,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 02:05:21,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 02:05:21,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:21,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:21,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:05:21,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:22,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216331282] [2025-03-09 02:05:22,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672542930] [2025-03-09 02:05:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672542930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:22,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:22,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:05:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916141107] [2025-03-09 02:05:22,597 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:22,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:05:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:22,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:05:22,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:05:22,598 INFO L87 Difference]: Start difference. First operand 252 states and 263 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:22,931 INFO L93 Difference]: Finished difference Result 252 states and 263 transitions. [2025-03-09 02:05:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:05:22,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 103 [2025-03-09 02:05:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:22,933 INFO L225 Difference]: With dead ends: 252 [2025-03-09 02:05:22,933 INFO L226 Difference]: Without dead ends: 247 [2025-03-09 02:05:22,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:05:22,934 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 120 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:22,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 193 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:05:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-09 02:05:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-09 02:05:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 232 states have internal predecessors, (234), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:05:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 258 transitions. [2025-03-09 02:05:22,941 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 258 transitions. Word has length 103 [2025-03-09 02:05:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:22,941 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 258 transitions. [2025-03-09 02:05:22,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 258 transitions. [2025-03-09 02:05:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 02:05:22,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:22,942 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:22,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:05:23,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:23,143 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:23,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:23,143 INFO L85 PathProgramCache]: Analyzing trace with hash -759090339, now seen corresponding path program 1 times [2025-03-09 02:05:23,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095254452] [2025-03-09 02:05:23,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:23,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:05:23,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:05:23,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:23,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:23,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584125589] [2025-03-09 02:05:23,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:23,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:23,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:23,158 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:23,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:05:23,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:05:23,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:05:23,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:23,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:23,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:05:23,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:05:23,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:05:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095254452] [2025-03-09 02:05:23,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584125589] [2025-03-09 02:05:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584125589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:05:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356654469] [2025-03-09 02:05:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:23,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:23,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:23,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:23,287 INFO L87 Difference]: Start difference. First operand 247 states and 258 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:05:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:23,429 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions. [2025-03-09 02:05:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:05:23,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2025-03-09 02:05:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:23,433 INFO L225 Difference]: With dead ends: 248 [2025-03-09 02:05:23,433 INFO L226 Difference]: Without dead ends: 247 [2025-03-09 02:05:23,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:23,434 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 73 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:23,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 271 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-09 02:05:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-09 02:05:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 173 states have (on average 1.346820809248555) internal successors, (233), 232 states have internal predecessors, (233), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:05:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 257 transitions. [2025-03-09 02:05:23,440 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 257 transitions. Word has length 105 [2025-03-09 02:05:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:23,441 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 257 transitions. [2025-03-09 02:05:23,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:05:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 257 transitions. [2025-03-09 02:05:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 02:05:23,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:23,442 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:23,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 02:05:23,643 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -685598984, now seen corresponding path program 1 times [2025-03-09 02:05:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172183603] [2025-03-09 02:05:23,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:23,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 02:05:23,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:05:23,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:23,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593992966] [2025-03-09 02:05:23,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:23,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:23,661 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:23,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:05:23,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 02:05:23,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:05:23,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:23,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:23,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:05:23,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:23,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172183603] [2025-03-09 02:05:28,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593992966] [2025-03-09 02:05:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593992966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:28,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:05:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078630976] [2025-03-09 02:05:28,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:05:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:28,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:05:28,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2025-03-09 02:05:28,099 INFO L87 Difference]: Start difference. First operand 247 states and 257 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:28,420 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2025-03-09 02:05:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:05:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 104 [2025-03-09 02:05:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:28,421 INFO L225 Difference]: With dead ends: 247 [2025-03-09 02:05:28,421 INFO L226 Difference]: Without dead ends: 239 [2025-03-09 02:05:28,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=37, Invalid=52, Unknown=1, NotChecked=0, Total=90 [2025-03-09 02:05:28,422 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 262 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:28,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 130 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:05:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-09 02:05:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-09 02:05:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 173 states have (on average 1.300578034682081) internal successors, (225), 224 states have internal predecessors, (225), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:05:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 249 transitions. [2025-03-09 02:05:28,428 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 249 transitions. Word has length 104 [2025-03-09 02:05:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:28,428 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 249 transitions. [2025-03-09 02:05:28,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 249 transitions. [2025-03-09 02:05:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:05:28,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:28,429 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:28,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:05:28,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 02:05:28,630 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:28,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2056963920, now seen corresponding path program 1 times [2025-03-09 02:05:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:28,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114598260] [2025-03-09 02:05:28,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:28,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:05:28,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:05:28,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:28,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57138756] [2025-03-09 02:05:28,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:28,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:28,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:28,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:28,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:05:28,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:05:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:05:28,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:28,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:28,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:05:28,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:05:28,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:05:28,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:28,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114598260] [2025-03-09 02:05:28,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:28,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57138756] [2025-03-09 02:05:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57138756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:05:28,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:05:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:05:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010778234] [2025-03-09 02:05:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:05:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:05:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:28,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:05:28,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:05:28,845 INFO L87 Difference]: Start difference. First operand 239 states and 249 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:05:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:29,055 INFO L93 Difference]: Finished difference Result 240 states and 249 transitions. [2025-03-09 02:05:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:05:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2025-03-09 02:05:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:29,056 INFO L225 Difference]: With dead ends: 240 [2025-03-09 02:05:29,056 INFO L226 Difference]: Without dead ends: 219 [2025-03-09 02:05:29,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:05:29,056 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:29,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 299 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:05:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-09 02:05:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-09 02:05:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 206 states have internal predecessors, (206), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:05:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 226 transitions. [2025-03-09 02:05:29,062 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 226 transitions. Word has length 106 [2025-03-09 02:05:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:29,062 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 226 transitions. [2025-03-09 02:05:29,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:05:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 226 transitions. [2025-03-09 02:05:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 02:05:29,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:29,063 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:29,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:29,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 02:05:29,264 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:29,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 221268102, now seen corresponding path program 1 times [2025-03-09 02:05:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676017862] [2025-03-09 02:05:29,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:29,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:05:29,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:05:29,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:29,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419831057] [2025-03-09 02:05:29,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:29,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:29,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:29,277 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:29,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:05:29,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:05:29,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:05:29,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:29,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:29,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:05:29,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:29,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676017862] [2025-03-09 02:05:29,812 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419831057] [2025-03-09 02:05:29,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419831057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:29,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:05:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770748138] [2025-03-09 02:05:29,813 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:29,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:05:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:29,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:05:29,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:05:29,813 INFO L87 Difference]: Start difference. First operand 219 states and 226 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:30,062 INFO L93 Difference]: Finished difference Result 219 states and 226 transitions. [2025-03-09 02:05:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:05:30,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 105 [2025-03-09 02:05:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:30,063 INFO L225 Difference]: With dead ends: 219 [2025-03-09 02:05:30,063 INFO L226 Difference]: Without dead ends: 208 [2025-03-09 02:05:30,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:05:30,063 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:30,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 214 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:05:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-09 02:05:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-09 02:05:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 155 states have (on average 1.2580645161290323) internal successors, (195), 195 states have internal predecessors, (195), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:05:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 215 transitions. [2025-03-09 02:05:30,068 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 215 transitions. Word has length 105 [2025-03-09 02:05:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:30,069 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 215 transitions. [2025-03-09 02:05:30,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:05:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 215 transitions. [2025-03-09 02:05:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:05:30,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:30,069 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:30,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 02:05:30,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 02:05:30,270 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:30,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1730623306, now seen corresponding path program 1 times [2025-03-09 02:05:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:30,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240984] [2025-03-09 02:05:30,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:30,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:05:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:05:30,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:30,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:30,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953650784] [2025-03-09 02:05:30,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:30,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:30,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:30,285 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:30,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:05:30,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:05:30,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:05:30,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:30,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:30,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:05:30,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:31,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:05:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240984] [2025-03-09 02:05:31,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953650784] [2025-03-09 02:05:31,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953650784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:05:31,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:05:31,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 02:05:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459382304] [2025-03-09 02:05:31,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:31,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:05:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:31,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:05:31,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:05:31,627 INFO L87 Difference]: Start difference. First operand 208 states and 215 transitions. Second operand has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-09 02:05:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:32,056 INFO L93 Difference]: Finished difference Result 208 states and 215 transitions. [2025-03-09 02:05:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:05:32,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2025-03-09 02:05:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:32,057 INFO L225 Difference]: With dead ends: 208 [2025-03-09 02:05:32,057 INFO L226 Difference]: Without dead ends: 185 [2025-03-09 02:05:32,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:05:32,058 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 257 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:32,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 125 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:05:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-09 02:05:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-09 02:05:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 147 states have (on average 1.1700680272108843) internal successors, (172), 172 states have internal predecessors, (172), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:05:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2025-03-09 02:05:32,066 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 106 [2025-03-09 02:05:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:32,067 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2025-03-09 02:05:32,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-09 02:05:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2025-03-09 02:05:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-09 02:05:32,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:32,068 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:32,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 02:05:32,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:32,269 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:32,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash -913493952, now seen corresponding path program 1 times [2025-03-09 02:05:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034652148] [2025-03-09 02:05:32,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:32,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-09 02:05:32,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-09 02:05:32,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:32,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:05:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034652148] [2025-03-09 02:05:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034652148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614717563] [2025-03-09 02:05:32,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:32,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:32,347 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:32,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 02:05:32,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-09 02:05:32,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-09 02:05:32,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:32,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:32,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:05:32,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:05:32,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:05:32,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614717563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:05:32,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:05:32,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:05:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204130290] [2025-03-09 02:05:32,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:32,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:05:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:32,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:05:32,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:05:32,675 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 7 states, 6 states have (on average 39.666666666666664) internal successors, (238), 7 states have internal predecessors, (238), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-09 02:05:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:32,814 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2025-03-09 02:05:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:05:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.666666666666664) internal successors, (238), 7 states have internal predecessors, (238), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 124 [2025-03-09 02:05:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:32,815 INFO L225 Difference]: With dead ends: 185 [2025-03-09 02:05:32,815 INFO L226 Difference]: Without dead ends: 175 [2025-03-09 02:05:32,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:05:32,816 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 128 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:32,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 171 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-09 02:05:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-09 02:05:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 145 states have (on average 1.1172413793103448) internal successors, (162), 162 states have internal predecessors, (162), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:05:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2025-03-09 02:05:32,821 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 124 [2025-03-09 02:05:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:32,821 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2025-03-09 02:05:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.666666666666664) internal successors, (238), 7 states have internal predecessors, (238), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-09 02:05:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2025-03-09 02:05:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-09 02:05:32,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:32,822 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:32,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 02:05:33,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 02:05:33,026 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:33,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1746458655, now seen corresponding path program 1 times [2025-03-09 02:05:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819450123] [2025-03-09 02:05:33,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:33,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 02:05:33,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 02:05:33,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:33,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:33,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148674248] [2025-03-09 02:05:33,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:33,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:33,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:33,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:33,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 02:05:33,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 02:05:33,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 02:05:33,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:33,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:33,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:05:33,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 02:05:33,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:33,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819450123] [2025-03-09 02:05:33,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148674248] [2025-03-09 02:05:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148674248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:05:33,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:05:33,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-09 02:05:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8282071] [2025-03-09 02:05:33,513 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:05:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:33,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:05:33,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:05:33,514 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:05:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:33,860 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2025-03-09 02:05:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:05:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-09 02:05:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:33,861 INFO L225 Difference]: With dead ends: 179 [2025-03-09 02:05:33,861 INFO L226 Difference]: Without dead ends: 161 [2025-03-09 02:05:33,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:05:33,863 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 107 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:33,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:05:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-09 02:05:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2025-03-09 02:05:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.0) internal successors, (144), 144 states have internal predecessors, (144), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:05:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2025-03-09 02:05:33,869 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 125 [2025-03-09 02:05:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:33,869 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2025-03-09 02:05:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:05:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2025-03-09 02:05:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-09 02:05:33,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:05:33,870 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:33,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:34,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 02:05:34,072 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-09 02:05:34,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:05:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash 85589700, now seen corresponding path program 1 times [2025-03-09 02:05:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:05:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012903705] [2025-03-09 02:05:34,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:05:34,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-09 02:05:34,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-09 02:05:34,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:34,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:05:34,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258690506] [2025-03-09 02:05:34,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:05:34,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:05:34,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:05:34,099 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:05:34,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 02:05:34,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-09 02:05:34,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-09 02:05:34,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:05:34,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:05:34,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:05:34,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:05:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:05:34,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:05:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:05:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:05:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012903705] [2025-03-09 02:05:34,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:05:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258690506] [2025-03-09 02:05:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258690506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:05:34,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:05:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 02:05:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663832576] [2025-03-09 02:05:34,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:05:34,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:05:34,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:05:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:05:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:05:34,866 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand has 10 states, 9 states have (on average 30.88888888888889) internal successors, (278), 10 states have internal predecessors, (278), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-09 02:05:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:05:35,007 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2025-03-09 02:05:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:05:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 30.88888888888889) internal successors, (278), 10 states have internal predecessors, (278), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 188 [2025-03-09 02:05:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:05:35,012 INFO L225 Difference]: With dead ends: 157 [2025-03-09 02:05:35,012 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:05:35,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:05:35,012 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:05:35,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:05:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:05:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:05:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:05:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:05:35,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2025-03-09 02:05:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:05:35,013 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:05:35,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 30.88888888888889) internal successors, (278), 10 states have internal predecessors, (278), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-09 02:05:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:05:35,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:05:35,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 140 remaining) [2025-03-09 02:05:35,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 140 remaining) [2025-03-09 02:05:35,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 140 remaining) [2025-03-09 02:05:35,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 140 remaining) [2025-03-09 02:05:35,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 140 remaining) [2025-03-09 02:05:35,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 140 remaining) [2025-03-09 02:05:35,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 140 remaining) [2025-03-09 02:05:35,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 140 remaining) [2025-03-09 02:05:35,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 140 remaining) [2025-03-09 02:05:35,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 140 remaining) [2025-03-09 02:05:35,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 140 remaining) [2025-03-09 02:05:35,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 140 remaining) [2025-03-09 02:05:35,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 140 remaining) [2025-03-09 02:05:35,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 140 remaining) [2025-03-09 02:05:35,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 02:05:35,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 02:05:35,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:05:35,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:05:35,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:05:35,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:05:35 BoogieIcfgContainer [2025-03-09 02:05:35,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:05:35,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:05:35,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:05:35,669 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:05:35,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:05:11" (3/4) ... [2025-03-09 02:05:35,671 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:05:35,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:05:35,682 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:05:35,682 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:05:35,682 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:05:35,683 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:05:35,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:05:35,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:05:35,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:05:35,747 INFO L158 Benchmark]: Toolchain (without parser) took 25553.91ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 113.3MB in the beginning and 448.0MB in the end (delta: -334.7MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2025-03-09 02:05:35,747 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:05:35,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.01ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:05:35,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.88ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:05:35,748 INFO L158 Benchmark]: Boogie Preprocessor took 42.26ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:05:35,748 INFO L158 Benchmark]: IcfgBuilder took 631.72ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 59.2MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 02:05:35,748 INFO L158 Benchmark]: TraceAbstraction took 24587.61ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 58.7MB in the beginning and 456.4MB in the end (delta: -397.7MB). Peak memory consumption was 256.5MB. Max. memory is 16.1GB. [2025-03-09 02:05:35,748 INFO L158 Benchmark]: Witness Printer took 78.09ms. Allocated memory is still 520.1MB. Free memory was 456.4MB in the beginning and 448.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:05:35,749 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.23ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.01ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.88ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.26ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 631.72ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 59.2MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24587.61ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 58.7MB in the beginning and 456.4MB in the end (delta: -397.7MB). Peak memory consumption was 256.5MB. Max. memory is 16.1GB. * Witness Printer took 78.09ms. Allocated memory is still 520.1MB. Free memory was 456.4MB in the beginning and 448.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 306 locations, 330 edges, 140 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 29, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5245 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5098 mSDsluCounter, 13083 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7023 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8402 IncrementalHoareTripleChecker+Invalid, 8710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 6060 mSDtfsCounter, 8402 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2507 GetRequests, 2378 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=19, InterpolantAutomatonStates: 134, 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, 29 MinimizatonAttempts, 682 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 4131 NumberOfCodeBlocks, 4131 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3572 ConstructedInterpolants, 9 QuantifiedInterpolants, 22366 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2836 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 40 InterpolantComputations, 19 PerfectInterpolantSequences, 2155/2237 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 140 specifications checked. All of them hold - InvariantResult [Line: 33]: Location Invariant Derived location invariant: ((((((((7 == y) && (z == 12)) && (x == 1)) && (n == 1)) && (0 <= a)) && (counter == 1)) && (a <= 32767)) || ((((((y == 1) && (counter == 0)) && ((((a + 1) <= 0) && (0 <= (a + 32768))) || ((0 <= a) && (a <= 32767)))) && (n == 0)) && (x == 0)) && (6 == z))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:05:35,770 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