./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/ps6-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-nla/ps6-both-nt.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 32e66fa5ba3b1091e41b22524f2240292238d833cea4ffc730b1e622c7455b67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:37:54,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:37:54,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:37:54,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:37:54,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:37:54,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:37:54,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:37:54,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:37:54,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:37:54,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:37:54,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:37:54,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:37:54,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:37:54,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:37:54,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:37:54,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:37:54,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:37:54,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:37:54,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:37:54,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:37:54,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:37:54,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:37:54,623 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 -> 32e66fa5ba3b1091e41b22524f2240292238d833cea4ffc730b1e622c7455b67 [2025-03-04 10:37:54,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:37:54,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:37:54,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:37:54,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:37:54,834 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:37:54,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/ps6-both-nt.c [2025-03-04 10:37:56,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913975460/82fd4fbb66864c92a43d86bab19da531/FLAGaaae3b27c [2025-03-04 10:37:56,332 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:37:56,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/ps6-both-nt.c [2025-03-04 10:37:56,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913975460/82fd4fbb66864c92a43d86bab19da531/FLAGaaae3b27c [2025-03-04 10:37:56,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913975460/82fd4fbb66864c92a43d86bab19da531 [2025-03-04 10:37:56,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:37:56,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:37:56,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:37:56,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:37:56,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:37:56,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6e0deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56, skipping insertion in model container [2025-03-04 10:37:56,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:37:56,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:37:56,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:37:56,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:37:56,738 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:37:56,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56 WrapperNode [2025-03-04 10:37:56,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:37:56,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:37:56,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:37:56,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:37:56,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,761 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2025-03-04 10:37:56,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:37:56,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:37:56,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:37:56,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:37:56,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,772 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:37:56,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:37:56,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:37:56,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:37:56,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:37:56,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (1/1) ... [2025-03-04 10:37:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:37:56,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:56,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:37:56,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:37:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:37:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:37:56,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:37:56,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:37:57,177 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-04 10:37:57,177 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:37:57,185 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:37:57,185 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:37:57,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:37:57 BoogieIcfgContainer [2025-03-04 10:37:57,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:37:57,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:37:57,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:37:57,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:37:57,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:37:56" (1/3) ... [2025-03-04 10:37:57,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a0b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:37:57, skipping insertion in model container [2025-03-04 10:37:57,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:37:56" (2/3) ... [2025-03-04 10:37:57,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a0b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:37:57, skipping insertion in model container [2025-03-04 10:37:57,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:37:57" (3/3) ... [2025-03-04 10:37:57,193 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-both-nt.c [2025-03-04 10:37:57,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:37:57,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-both-nt.c that has 1 procedures, 119 locations, 1 initial locations, 1 loop locations, and 56 error locations. [2025-03-04 10:37:57,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:37:57,256 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;@2b73ea0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:37:57,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-04 10:37:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 1.935483870967742) internal successors, (120), 118 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 10:37:57,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:57,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 10:37:57,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:57,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 147924, now seen corresponding path program 1 times [2025-03-04 10:37:57,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32427871] [2025-03-04 10:37:57,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:57,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:37:57,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:37:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:57,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:57,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32427871] [2025-03-04 10:37:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32427871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:57,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:57,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676290783] [2025-03-04 10:37:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:57,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:57,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:57,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:57,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:57,394 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 1.935483870967742) internal successors, (120), 118 states have internal predecessors, (120), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:57,643 INFO L93 Difference]: Finished difference Result 183 states and 218 transitions. [2025-03-04 10:37:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 10:37:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:57,651 INFO L225 Difference]: With dead ends: 183 [2025-03-04 10:37:57,651 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 10:37:57,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:57,655 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 50 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:57,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 51 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:37:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 10:37:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-03-04 10:37:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.650943396226415) internal successors, (175), 148 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 175 transitions. [2025-03-04 10:37:57,685 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 175 transitions. Word has length 3 [2025-03-04 10:37:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 175 transitions. [2025-03-04 10:37:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 175 transitions. [2025-03-04 10:37:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:37:57,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:57,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:37:57,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:37:57,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:57,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 4585727, now seen corresponding path program 1 times [2025-03-04 10:37:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:57,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850503160] [2025-03-04 10:37:57,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:57,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:57,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:37:57,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:37:57,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:57,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:57,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850503160] [2025-03-04 10:37:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850503160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317766778] [2025-03-04 10:37:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:57,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:57,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:57,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:57,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:57,722 INFO L87 Difference]: Start difference. First operand 149 states and 175 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:57,850 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2025-03-04 10:37:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:57,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 10:37:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:57,851 INFO L225 Difference]: With dead ends: 149 [2025-03-04 10:37:57,851 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 10:37:57,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:57,853 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:57,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 11 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 10:37:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 10:37:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2025-03-04 10:37:57,861 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 4 [2025-03-04 10:37:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:57,861 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2025-03-04 10:37:57,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2025-03-04 10:37:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:37:57,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:57,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:37:57,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:37:57,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:57,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash 142157618, now seen corresponding path program 1 times [2025-03-04 10:37:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:57,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752359314] [2025-03-04 10:37:57,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:57,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:37:57,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:37:57,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:57,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:57,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448646733] [2025-03-04 10:37:57,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:57,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:57,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:57,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:57,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:37:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:37:57,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:37:57,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:57,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:57,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:37:57,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:57,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:57,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752359314] [2025-03-04 10:37:57,926 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448646733] [2025-03-04 10:37:57,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448646733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:57,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:57,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:57,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037082763] [2025-03-04 10:37:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:57,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:57,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:57,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:57,927 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:58,085 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2025-03-04 10:37:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:37:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:58,087 INFO L225 Difference]: With dead ends: 153 [2025-03-04 10:37:58,087 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 10:37:58,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:58,088 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:58,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 55 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 10:37:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-03-04 10:37:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 137 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2025-03-04 10:37:58,099 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 5 [2025-03-04 10:37:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:58,100 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2025-03-04 10:37:58,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2025-03-04 10:37:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:37:58,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:58,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:58,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:37:58,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:58,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash 35039182, now seen corresponding path program 1 times [2025-03-04 10:37:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456775199] [2025-03-04 10:37:58,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:58,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:37:58,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:37:58,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456775199] [2025-03-04 10:37:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456775199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:58,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:58,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588892534] [2025-03-04 10:37:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:58,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:58,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:58,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:58,407 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:58,436 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2025-03-04 10:37:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:58,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2025-03-04 10:37:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:58,437 INFO L225 Difference]: With dead ends: 139 [2025-03-04 10:37:58,437 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 10:37:58,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:58,438 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:58,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 10:37:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 10:37:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.349056603773585) internal successors, (143), 137 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2025-03-04 10:37:58,443 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 41 [2025-03-04 10:37:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:58,443 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2025-03-04 10:37:58,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2025-03-04 10:37:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:37:58,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:58,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:37:58,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1086214649, now seen corresponding path program 1 times [2025-03-04 10:37:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590576683] [2025-03-04 10:37:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:58,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:37:58,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:37:58,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590576683] [2025-03-04 10:37:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590576683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:58,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:58,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605523148] [2025-03-04 10:37:58,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:58,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:58,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:58,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:58,530 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:58,562 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2025-03-04 10:37:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-03-04 10:37:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:58,563 INFO L225 Difference]: With dead ends: 156 [2025-03-04 10:37:58,564 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 10:37:58,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:58,565 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:58,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 158 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 10:37:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2025-03-04 10:37:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.330188679245283) internal successors, (141), 137 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2025-03-04 10:37:58,573 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 42 [2025-03-04 10:37:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:58,573 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2025-03-04 10:37:58,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2025-03-04 10:37:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:37:58,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:58,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:37:58,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:58,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -687084244, now seen corresponding path program 1 times [2025-03-04 10:37:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:58,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588014584] [2025-03-04 10:37:58,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:58,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:37:58,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:37:58,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:58,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588014584] [2025-03-04 10:37:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588014584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:37:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367285926] [2025-03-04 10:37:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:58,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:58,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:58,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:58,663 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:58,868 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2025-03-04 10:37:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:37:58,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2025-03-04 10:37:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:58,869 INFO L225 Difference]: With dead ends: 139 [2025-03-04 10:37:58,869 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 10:37:58,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:37:58,869 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 73 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:58,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 99 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:37:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 10:37:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 10:37:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.320754716981132) internal successors, (140), 137 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2025-03-04 10:37:58,877 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 43 [2025-03-04 10:37:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:58,877 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2025-03-04 10:37:58,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2025-03-04 10:37:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:37:58,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:58,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:58,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:37:58,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:58,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash 887422676, now seen corresponding path program 1 times [2025-03-04 10:37:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190762591] [2025-03-04 10:37:58,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:37:58,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:37:58,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190762591] [2025-03-04 10:37:58,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190762591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:58,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:58,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593501108] [2025-03-04 10:37:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:58,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:58,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:58,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:58,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:58,949 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:58,957 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2025-03-04 10:37:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2025-03-04 10:37:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:58,958 INFO L225 Difference]: With dead ends: 138 [2025-03-04 10:37:58,958 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 10:37:58,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:58,958 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:58,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 88 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 10:37:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 10:37:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 136 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2025-03-04 10:37:58,963 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 46 [2025-03-04 10:37:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:58,963 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2025-03-04 10:37:58,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2025-03-04 10:37:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:37:58,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:58,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:58,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:37:58,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:58,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1740299177, now seen corresponding path program 1 times [2025-03-04 10:37:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:58,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645766378] [2025-03-04 10:37:58,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:58,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:37:58,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:37:58,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:58,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645766378] [2025-03-04 10:37:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645766378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:59,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:37:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850026136] [2025-03-04 10:37:59,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:59,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:37:59,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:59,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:37:59,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:59,004 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:59,010 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2025-03-04 10:37:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:37:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-03-04 10:37:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:59,011 INFO L225 Difference]: With dead ends: 138 [2025-03-04 10:37:59,011 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 10:37:59,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:37:59,012 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:59,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:37:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 10:37:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 10:37:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 136 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2025-03-04 10:37:59,015 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 47 [2025-03-04 10:37:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:59,016 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2025-03-04 10:37:59,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2025-03-04 10:37:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:37:59,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:59,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:59,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:37:59,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:59,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash 304119269, now seen corresponding path program 1 times [2025-03-04 10:37:59,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:59,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61800529] [2025-03-04 10:37:59,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:59,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:37:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:37:59,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:59,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457444663] [2025-03-04 10:37:59,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:59,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:59,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:37:59,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:37:59,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:37:59,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:37:59,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:37:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:37:59,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:59,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61800529] [2025-03-04 10:37:59,137 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:37:59,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457444663] [2025-03-04 10:37:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457444663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:37:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317883015] [2025-03-04 10:37:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:59,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:59,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:59,138 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:59,320 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2025-03-04 10:37:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:37:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2025-03-04 10:37:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:59,321 INFO L225 Difference]: With dead ends: 221 [2025-03-04 10:37:59,321 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 10:37:59,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:59,322 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:59,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 53 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:37:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 10:37:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-03-04 10:37:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 163 states have (on average 1.2331288343558282) internal successors, (201), 193 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 201 transitions. [2025-03-04 10:37:59,326 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 201 transitions. Word has length 51 [2025-03-04 10:37:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:59,326 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 201 transitions. [2025-03-04 10:37:59,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2025-03-04 10:37:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:37:59,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:59,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:59,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:37:59,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 10:37:59,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:59,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1593036424, now seen corresponding path program 1 times [2025-03-04 10:37:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550076331] [2025-03-04 10:37:59,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:59,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:37:59,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:37:59,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550076331] [2025-03-04 10:37:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550076331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:59,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:37:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979501761] [2025-03-04 10:37:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:59,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:59,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:59,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:59,588 INFO L87 Difference]: Start difference. First operand 194 states and 201 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:59,726 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2025-03-04 10:37:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:37:59,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2025-03-04 10:37:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:59,727 INFO L225 Difference]: With dead ends: 194 [2025-03-04 10:37:59,727 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 10:37:59,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:37:59,728 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:59,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 86 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 10:37:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 10:37:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.2208588957055215) internal successors, (199), 192 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 199 transitions. [2025-03-04 10:37:59,741 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 199 transitions. Word has length 58 [2025-03-04 10:37:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 199 transitions. [2025-03-04 10:37:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 199 transitions. [2025-03-04 10:37:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 10:37:59,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:59,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:37:59,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2139488861, now seen corresponding path program 1 times [2025-03-04 10:37:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754622832] [2025-03-04 10:37:59,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:59,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:37:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:37:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:59,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:37:59,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754622832] [2025-03-04 10:37:59,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754622832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:37:59,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:37:59,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:37:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610365580] [2025-03-04 10:37:59,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:37:59,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:37:59,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:59,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:37:59,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:37:59,798 INFO L87 Difference]: Start difference. First operand 193 states and 199 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:37:59,917 INFO L93 Difference]: Finished difference Result 194 states and 199 transitions. [2025-03-04 10:37:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:37:59,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-03-04 10:37:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:37:59,918 INFO L225 Difference]: With dead ends: 194 [2025-03-04 10:37:59,919 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 10:37:59,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:37:59,919 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:37:59,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 122 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:37:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 10:37:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 10:37:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.2147239263803682) internal successors, (198), 192 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 198 transitions. [2025-03-04 10:37:59,926 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 198 transitions. Word has length 59 [2025-03-04 10:37:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:37:59,926 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 198 transitions. [2025-03-04 10:37:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:37:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 198 transitions. [2025-03-04 10:37:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 10:37:59,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:37:59,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:37:59,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:37:59,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:37:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:37:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1261519726, now seen corresponding path program 1 times [2025-03-04 10:37:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:37:59,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879991439] [2025-03-04 10:37:59,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:37:59,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:37:59,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:37:59,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:37:59,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926291118] [2025-03-04 10:37:59,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:37:59,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:37:59,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:37:59,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:37:59,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:37:59,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:37:59,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:37:59,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:37:59,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:37:59,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:37:59,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:00,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:00,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879991439] [2025-03-04 10:38:00,434 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:38:00,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926291118] [2025-03-04 10:38:00,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926291118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:00,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:38:00,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 10:38:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145543859] [2025-03-04 10:38:00,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:00,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:38:00,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:00,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:38:00,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:38:00,436 INFO L87 Difference]: Start difference. First operand 193 states and 198 transitions. Second operand has 8 states, 7 states have (on average 27.857142857142858) internal successors, (195), 8 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:00,754 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2025-03-04 10:38:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:38:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 27.857142857142858) internal successors, (195), 8 states have internal predecessors, (195), 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 98 [2025-03-04 10:38:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:00,756 INFO L225 Difference]: With dead ends: 210 [2025-03-04 10:38:00,756 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 10:38:00,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:38:00,757 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 119 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:00,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 61 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:38:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 10:38:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2025-03-04 10:38:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 163 states have (on average 1.1901840490797546) internal successors, (194), 191 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2025-03-04 10:38:00,760 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 98 [2025-03-04 10:38:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:00,760 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2025-03-04 10:38:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 27.857142857142858) internal successors, (195), 8 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2025-03-04 10:38:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 10:38:00,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:00,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:00,769 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-04 10:38:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:00,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:38:00,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1139678992, now seen corresponding path program 1 times [2025-03-04 10:38:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860265015] [2025-03-04 10:38:00,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:00,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 10:38:00,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 10:38:00,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:00,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:38:00,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736328186] [2025-03-04 10:38:00,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:00,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:00,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:38:01,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 10:38:01,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 10:38:01,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:01,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:38:01,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:01,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:38:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:01,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860265015] [2025-03-04 10:38:01,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:38:01,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736328186] [2025-03-04 10:38:01,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736328186] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:01,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:38:01,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 10:38:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955025374] [2025-03-04 10:38:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:38:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:38:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:01,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:38:01,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:38:01,547 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:04,961 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2025-03-04 10:38:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:38:04,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 100 [2025-03-04 10:38:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:04,963 INFO L225 Difference]: With dead ends: 192 [2025-03-04 10:38:04,963 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 10:38:04,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:38:04,963 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 47 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:04,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 10 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-04 10:38:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 10:38:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-04 10:38:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 163 states have (on average 1.177914110429448) internal successors, (192), 190 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2025-03-04 10:38:04,967 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 100 [2025-03-04 10:38:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:04,967 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2025-03-04 10:38:04,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2025-03-04 10:38:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 10:38:04,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:04,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:04,974 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-04 10:38:05,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:05,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:38:05,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1386656403, now seen corresponding path program 1 times [2025-03-04 10:38:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:05,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999430355] [2025-03-04 10:38:05,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:05,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 10:38:05,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 10:38:05,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:05,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999430355] [2025-03-04 10:38:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999430355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:38:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035850261] [2025-03-04 10:38:05,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:05,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:05,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:05,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:38:05,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 10:38:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 10:38:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:05,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:05,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:38:05,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:05,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035850261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:05,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:38:05,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:38:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347450344] [2025-03-04 10:38:05,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:05,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:38:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:05,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:38:05,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:38:05,522 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand has 6 states, 5 states have (on average 41.4) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:05,543 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2025-03-04 10:38:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:38:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 41.4) internal successors, (207), 6 states have internal predecessors, (207), 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 104 [2025-03-04 10:38:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:05,544 INFO L225 Difference]: With dead ends: 357 [2025-03-04 10:38:05,544 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 10:38:05,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:38:05,545 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 91 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:05,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 387 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:38:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 10:38:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 303. [2025-03-04 10:38:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 275 states have (on average 1.2945454545454544) internal successors, (356), 302 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 356 transitions. [2025-03-04 10:38:05,556 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 356 transitions. Word has length 104 [2025-03-04 10:38:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:05,556 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 356 transitions. [2025-03-04 10:38:05,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.4) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 356 transitions. [2025-03-04 10:38:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 10:38:05,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:05,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:38:05,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:05,761 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,SelfDestructingSolverStorable13 [2025-03-04 10:38:05,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:38:05,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1679266391, now seen corresponding path program 1 times [2025-03-04 10:38:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:05,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702407626] [2025-03-04 10:38:05,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:05,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:05,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 10:38:05,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 10:38:05,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:05,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:38:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553753836] [2025-03-04 10:38:05,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:05,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:05,778 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:05,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:38:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 10:38:05,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 10:38:05,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:05,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:05,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:38:05,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:05,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702407626] [2025-03-04 10:38:06,073 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:38:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553753836] [2025-03-04 10:38:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553753836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:06,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:38:06,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 10:38:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507002140] [2025-03-04 10:38:06,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:06,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:38:06,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:06,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:38:06,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:38:06,074 INFO L87 Difference]: Start difference. First operand 303 states and 356 transitions. Second operand has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:06,377 INFO L93 Difference]: Finished difference Result 322 states and 356 transitions. [2025-03-04 10:38:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:38:06,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 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 108 [2025-03-04 10:38:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:06,380 INFO L225 Difference]: With dead ends: 322 [2025-03-04 10:38:06,380 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 10:38:06,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:38:06,380 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 197 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:06,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 49 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:38:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 10:38:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2025-03-04 10:38:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 275 states have (on average 1.1672727272727272) internal successors, (321), 296 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 321 transitions. [2025-03-04 10:38:06,390 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 321 transitions. Word has length 108 [2025-03-04 10:38:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:06,390 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 321 transitions. [2025-03-04 10:38:06,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 321 transitions. [2025-03-04 10:38:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 10:38:06,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:06,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:38:06,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:38:06,594 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,SelfDestructingSolverStorable14 [2025-03-04 10:38:06,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:38:06,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1168904671, now seen corresponding path program 1 times [2025-03-04 10:38:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896560765] [2025-03-04 10:38:06,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:06,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 10:38:06,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 10:38:06,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:06,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:38:06,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122446658] [2025-03-04 10:38:06,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:06,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:06,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:06,608 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:38:06,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:38:06,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 10:38:06,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 10:38:06,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:06,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:06,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:38:06,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:06,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:08,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:08,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896560765] [2025-03-04 10:38:08,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:38:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122446658] [2025-03-04 10:38:08,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122446658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:08,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:38:08,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2025-03-04 10:38:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068045599] [2025-03-04 10:38:08,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:08,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:38:08,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:08,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:38:08,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:38:08,071 INFO L87 Difference]: Start difference. First operand 297 states and 321 transitions. Second operand has 11 states, 10 states have (on average 23.1) internal successors, (231), 11 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:13,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:19,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:24,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:28,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:32,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:33,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:37,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:38:37,255 INFO L93 Difference]: Finished difference Result 297 states and 321 transitions. [2025-03-04 10:38:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:38:37,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 23.1) internal successors, (231), 11 states have internal predecessors, (231), 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 116 [2025-03-04 10:38:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:38:37,257 INFO L225 Difference]: With dead ends: 297 [2025-03-04 10:38:37,257 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 10:38:37,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:38:37,257 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 123 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 11 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:38:37,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 29 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 717 Invalid, 5 Unknown, 0 Unchecked, 29.0s Time] [2025-03-04 10:38:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 10:38:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 10:38:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 275 states have (on average 1.1563636363636363) internal successors, (318), 295 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 318 transitions. [2025-03-04 10:38:37,266 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 318 transitions. Word has length 116 [2025-03-04 10:38:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:38:37,266 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 318 transitions. [2025-03-04 10:38:37,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 23.1) internal successors, (231), 11 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 318 transitions. [2025-03-04 10:38:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 10:38:37,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:38:37,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:38:37,279 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-04 10:38:37,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:37,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:38:37,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:38:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1089514873, now seen corresponding path program 1 times [2025-03-04 10:38:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:38:37,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473072273] [2025-03-04 10:38:37,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:38:37,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 10:38:37,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 10:38:37,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:37,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:38:37,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708134394] [2025-03-04 10:38:37,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:38:37,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:38:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:38:37,492 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-04 10:38:37,493 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-04 10:38:37,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 10:38:37,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 10:38:37,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:38:37,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:38:37,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:38:37,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:38:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:37,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:38:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:38:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:38:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473072273] [2025-03-04 10:38:38,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:38:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708134394] [2025-03-04 10:38:38,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708134394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:38:38,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:38:38,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2025-03-04 10:38:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821379829] [2025-03-04 10:38:38,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:38:38,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:38:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:38:38,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:38:38,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:38:38,810 INFO L87 Difference]: Start difference. First operand 296 states and 318 transitions. Second operand has 13 states, 12 states have (on average 25.916666666666668) internal successors, (311), 13 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:38:44,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:45,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:56,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:38:57,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:39:02,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:39:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:02,747 INFO L93 Difference]: Finished difference Result 427 states and 467 transitions. [2025-03-04 10:39:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:39:02,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 25.916666666666668) internal successors, (311), 13 states have internal predecessors, (311), 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 156 [2025-03-04 10:39:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:02,749 INFO L225 Difference]: With dead ends: 427 [2025-03-04 10:39:02,749 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 10:39:02,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:39:02,749 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 222 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:02,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 105 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1160 Invalid, 3 Unknown, 0 Unchecked, 23.5s Time] [2025-03-04 10:39:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 10:39:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 404. [2025-03-04 10:39:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 384 states have (on average 1.1901041666666667) internal successors, (457), 403 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 457 transitions. [2025-03-04 10:39:02,758 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 457 transitions. Word has length 156 [2025-03-04 10:39:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:02,758 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 457 transitions. [2025-03-04 10:39:02,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 25.916666666666668) internal successors, (311), 13 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 457 transitions. [2025-03-04 10:39:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 10:39:02,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:02,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:39:02,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:39:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:39:02,961 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:39:02,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash 382547105, now seen corresponding path program 1 times [2025-03-04 10:39:02,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:02,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065660064] [2025-03-04 10:39:02,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:02,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 10:39:02,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 10:39:02,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:02,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:39:02,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433335671] [2025-03-04 10:39:02,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:02,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:02,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:02,997 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-04 10:39:02,998 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-04 10:39:03,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 10:39:03,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 10:39:03,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:03,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:03,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:39:03,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:03,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:03,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:03,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065660064] [2025-03-04 10:39:03,477 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:39:03,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433335671] [2025-03-04 10:39:03,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433335671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:03,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:39:03,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:39:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066673240] [2025-03-04 10:39:03,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:03,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:39:03,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:03,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:39:03,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:39:03,478 INFO L87 Difference]: Start difference. First operand 404 states and 457 transitions. Second operand has 10 states, 9 states have (on average 37.44444444444444) internal successors, (337), 10 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:03,861 INFO L93 Difference]: Finished difference Result 413 states and 457 transitions. [2025-03-04 10:39:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:39:03,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 37.44444444444444) internal successors, (337), 10 states have internal predecessors, (337), 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 169 [2025-03-04 10:39:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:03,862 INFO L225 Difference]: With dead ends: 413 [2025-03-04 10:39:03,862 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 10:39:03,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:03,863 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 128 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:03,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 82 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:39:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 10:39:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-04 10:39:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 384 states have (on average 1.0859375) internal successors, (417), 395 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 417 transitions. [2025-03-04 10:39:03,872 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 417 transitions. Word has length 169 [2025-03-04 10:39:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:03,872 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 417 transitions. [2025-03-04 10:39:03,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 37.44444444444444) internal successors, (337), 10 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 417 transitions. [2025-03-04 10:39:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-04 10:39:03,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:03,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1] [2025-03-04 10:39:03,881 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-04 10:39:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:39:04,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:39:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash -916962941, now seen corresponding path program 1 times [2025-03-04 10:39:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417529769] [2025-03-04 10:39:04,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:04,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 10:39:04,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 10:39:04,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:04,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:39:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937408097] [2025-03-04 10:39:04,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:04,099 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-04 10:39:04,100 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-04 10:39:04,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 10:39:04,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 10:39:04,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:04,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:04,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:39:04,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:04,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417529769] [2025-03-04 10:39:05,511 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:39:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937408097] [2025-03-04 10:39:05,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937408097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:05,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:39:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:39:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478032181] [2025-03-04 10:39:05,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:39:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:39:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:05,513 INFO L87 Difference]: Start difference. First operand 396 states and 417 transitions. Second operand has 12 states, 11 states have (on average 41.36363636363637) internal successors, (455), 12 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:05,814 INFO L93 Difference]: Finished difference Result 399 states and 417 transitions. [2025-03-04 10:39:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:39:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 41.36363636363637) internal successors, (455), 12 states have internal predecessors, (455), 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 228 [2025-03-04 10:39:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:05,816 INFO L225 Difference]: With dead ends: 399 [2025-03-04 10:39:05,816 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 10:39:05,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:05,817 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:05,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 34 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:39:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 10:39:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 395. [2025-03-04 10:39:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 384 states have (on average 1.0729166666666667) internal successors, (412), 394 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 412 transitions. [2025-03-04 10:39:05,828 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 412 transitions. Word has length 228 [2025-03-04 10:39:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:05,828 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 412 transitions. [2025-03-04 10:39:05,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 41.36363636363637) internal successors, (455), 12 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 412 transitions. [2025-03-04 10:39:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 10:39:05,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:05,831 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 10:39:05,839 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-04 10:39:06,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:06,036 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:39:06,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1808426258, now seen corresponding path program 1 times [2025-03-04 10:39:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567914069] [2025-03-04 10:39:06,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:06,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 10:39:06,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 10:39:06,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:06,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:39:06,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614396524] [2025-03-04 10:39:06,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:06,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:06,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:06,060 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-04 10:39:06,061 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-04 10:39:06,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 10:39:06,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 10:39:06,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:06,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:06,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:39:06,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:06,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:06,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:06,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567914069] [2025-03-04 10:39:06,740 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:39:06,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614396524] [2025-03-04 10:39:06,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614396524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:06,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:39:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:39:06,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676255908] [2025-03-04 10:39:06,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:06,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:39:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:06,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:39:06,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:06,742 INFO L87 Difference]: Start difference. First operand 395 states and 412 transitions. Second operand has 12 states, 11 states have (on average 43.0) internal successors, (473), 12 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:07,210 INFO L93 Difference]: Finished difference Result 402 states and 412 transitions. [2025-03-04 10:39:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:39:07,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 43.0) internal successors, (473), 12 states have internal predecessors, (473), 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 237 [2025-03-04 10:39:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:07,212 INFO L225 Difference]: With dead ends: 402 [2025-03-04 10:39:07,212 INFO L226 Difference]: Without dead ends: 395 [2025-03-04 10:39:07,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:39:07,213 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 144 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:07,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 121 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:39:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-04 10:39:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 394. [2025-03-04 10:39:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 384 states have (on average 1.0494791666666667) internal successors, (403), 393 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 403 transitions. [2025-03-04 10:39:07,221 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 403 transitions. Word has length 237 [2025-03-04 10:39:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:07,221 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 403 transitions. [2025-03-04 10:39:07,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 43.0) internal successors, (473), 12 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 403 transitions. [2025-03-04 10:39:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 10:39:07,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:07,223 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 10:39:07,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:39:07,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:07,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:39:07,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash 343827625, now seen corresponding path program 2 times [2025-03-04 10:39:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:07,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777242787] [2025-03-04 10:39:07,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:39:07,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:07,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 275 statements into 2 equivalence classes. [2025-03-04 10:39:07,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 10:39:07,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:39:07,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777242787] [2025-03-04 10:39:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777242787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247320562] [2025-03-04 10:39:07,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:39:07,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:07,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:07,629 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-04 10:39:07,633 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-04 10:39:07,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 275 statements into 2 equivalence classes. [2025-03-04 10:39:07,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 10:39:07,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:39:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:07,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:39:07,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:07,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247320562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:08,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:39:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:39:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379572559] [2025-03-04 10:39:08,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:08,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:39:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:08,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:39:08,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:08,162 INFO L87 Difference]: Start difference. First operand 394 states and 403 transitions. Second operand has 12 states, 11 states have (on average 49.90909090909091) internal successors, (549), 12 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:08,198 INFO L93 Difference]: Finished difference Result 672 states and 677 transitions. [2025-03-04 10:39:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:39:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 49.90909090909091) internal successors, (549), 12 states have internal predecessors, (549), 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 275 [2025-03-04 10:39:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:08,200 INFO L225 Difference]: With dead ends: 672 [2025-03-04 10:39:08,200 INFO L226 Difference]: Without dead ends: 671 [2025-03-04 10:39:08,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:08,201 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 90 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:08,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 683 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-04 10:39:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 627. [2025-03-04 10:39:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 617 states have (on average 1.087520259319287) internal successors, (671), 626 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 671 transitions. [2025-03-04 10:39:08,214 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 671 transitions. Word has length 275 [2025-03-04 10:39:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 671 transitions. [2025-03-04 10:39:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 49.90909090909091) internal successors, (549), 12 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 671 transitions. [2025-03-04 10:39:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-04 10:39:08,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:08,218 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1] [2025-03-04 10:39:08,225 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-04 10:39:08,418 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,SelfDestructingSolverStorable20 [2025-03-04 10:39:08,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-04 10:39:08,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1517768176, now seen corresponding path program 1 times [2025-03-04 10:39:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701027716] [2025-03-04 10:39:08,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:08,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 10:39:08,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 10:39:08,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:08,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:39:08,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861547881] [2025-03-04 10:39:08,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:08,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:08,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:08,442 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-04 10:39:08,444 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-04 10:39:08,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 10:39:08,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 10:39:08,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:08,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:08,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:39:08,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:08,722 INFO L312 TraceCheckSpWp]: Computing backward predicates...