./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/DivMinus2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/DivMinus2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 804e8d646f3136915195a4e5e9f5153cc3c1cd2abf96df3f09c683a14a27e4de --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:49:46,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:49:46,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:49:46,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:49:46,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:49:46,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:49:46,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:49:46,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:49:46,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:49:46,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:49:46,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:49:46,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:49:46,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:49:46,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:49:46,895 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:49:46,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:49:46,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:49:46,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:49:46,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:49:46,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:49:46,897 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 804e8d646f3136915195a4e5e9f5153cc3c1cd2abf96df3f09c683a14a27e4de [2025-03-17 14:49:47,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:49:47,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:49:47,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:49:47,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:49:47,127 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:49:47,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/DivMinus2.c [2025-03-17 14:49:48,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c739e5a/0fd3cd01da274794992bda41107706f0/FLAG304ea17eb [2025-03-17 14:49:48,495 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:49:48,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/DivMinus2.c [2025-03-17 14:49:48,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c739e5a/0fd3cd01da274794992bda41107706f0/FLAG304ea17eb [2025-03-17 14:49:48,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c739e5a/0fd3cd01da274794992bda41107706f0 [2025-03-17 14:49:48,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:49:48,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:49:48,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:49:48,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:49:48,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:49:48,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:48,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f924156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48, skipping insertion in model container [2025-03-17 14:49:48,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:48,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:49:48,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:49:48,956 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:49:48,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:49:48,977 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:49:48,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48 WrapperNode [2025-03-17 14:49:48,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:49:48,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:49:48,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:49:48,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:49:48,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:48,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:48,998 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2025-03-17 14:49:48,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:49:48,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:49:48,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:49:48,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:49:49,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,009 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:49:49,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:49:49,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:49:49,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:49:49,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:49:49,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (1/1) ... [2025-03-17 14:49:49,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:49:49,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:49,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:49:49,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:49:49,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:49:49,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:49:49,122 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:49:49,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:49:49,226 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 14:49:49,226 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:49:49,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:49:49,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:49:49,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:49 BoogieIcfgContainer [2025-03-17 14:49:49,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:49:49,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:49:49,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:49:49,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:49:49,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:49:48" (1/3) ... [2025-03-17 14:49:49,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad59084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:49, skipping insertion in model container [2025-03-17 14:49:49,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:48" (2/3) ... [2025-03-17 14:49:49,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad59084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:49, skipping insertion in model container [2025-03-17 14:49:49,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:49" (3/3) ... [2025-03-17 14:49:49,244 INFO L128 eAbstractionObserver]: Analyzing ICFG DivMinus2.c [2025-03-17 14:49:49,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:49:49,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG DivMinus2.c that has 1 procedures, 26 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-17 14:49:49,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:49:49,304 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;@1ec719b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:49:49,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:49:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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-17 14:49:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:49:49,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:49:49,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1722860, now seen corresponding path program 1 times [2025-03-17 14:49:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884598629] [2025-03-17 14:49:49,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:49:49,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:49:49,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:49,446 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-17 14:49:49,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:49,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884598629] [2025-03-17 14:49:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884598629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:49,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:49:49,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437974173] [2025-03-17 14:49:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:49,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:49,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:49,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,471 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 2.0) internal successors, (4), 2 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-17 14:49:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:49,496 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-17 14:49:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-17 14:49:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:49,503 INFO L225 Difference]: With dead ends: 26 [2025-03-17 14:49:49,503 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 14:49:49,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,508 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:49,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 14:49:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 14:49:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 22 states have internal predecessors, (25), 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-17 14:49:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-17 14:49:49,531 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 4 [2025-03-17 14:49:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:49,531 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-17 14:49:49,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-17 14:49:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-17 14:49:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:49:49,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:49:49,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:49:49,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,533 INFO L85 PathProgramCache]: Analyzing trace with hash 53408238, now seen corresponding path program 1 times [2025-03-17 14:49:49,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617576045] [2025-03-17 14:49:49,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:49:49,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:49:49,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:49,560 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-17 14:49:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617576045] [2025-03-17 14:49:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617576045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:49,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:49:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597495679] [2025-03-17 14:49:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:49,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:49,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:49,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,561 INFO L87 Difference]: Start difference. First operand 23 states and 25 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-17 14:49:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:49,595 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-03-17 14:49:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:49,595 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-17 14:49:49,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:49,596 INFO L225 Difference]: With dead ends: 46 [2025-03-17 14:49:49,596 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 14:49:49,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,596 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:49,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 14:49:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 14:49:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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-17 14:49:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-17 14:49:49,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2025-03-17 14:49:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:49,600 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-17 14:49:49,600 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-17 14:49:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-17 14:49:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:49:49,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:49:49,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:49:49,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1655655357, now seen corresponding path program 1 times [2025-03-17 14:49:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134453562] [2025-03-17 14:49:49,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:49:49,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:49:49,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:49,636 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-17 14:49:49,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:49,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134453562] [2025-03-17 14:49:49,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134453562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:49,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:49,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:49:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901389349] [2025-03-17 14:49:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:49:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:49,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:49:49,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:49:49,638 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 14:49:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:49,679 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-17 14:49:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:49:49,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-17 14:49:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:49,680 INFO L225 Difference]: With dead ends: 24 [2025-03-17 14:49:49,680 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 14:49:49,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:49:49,680 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:49,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 14:49:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 14:49:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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-17 14:49:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-17 14:49:49,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 6 [2025-03-17 14:49:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:49,687 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-17 14:49:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 14:49:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-17 14:49:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:49:49,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:49:49,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:49:49,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash -214291508, now seen corresponding path program 1 times [2025-03-17 14:49:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421282056] [2025-03-17 14:49:49,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:49:49,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:49:49,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:49,720 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-17 14:49:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421282056] [2025-03-17 14:49:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421282056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:49:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805126501] [2025-03-17 14:49:49,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:49,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:49,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:49,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:49,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,722 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:49,736 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-17 14:49:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:49,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:49:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:49,737 INFO L225 Difference]: With dead ends: 28 [2025-03-17 14:49:49,737 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 14:49:49,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,738 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:49,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 14:49:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-17 14:49:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 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-17 14:49:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-17 14:49:49,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 7 [2025-03-17 14:49:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:49,742 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-17 14:49:49,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-17 14:49:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:49:49,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:49:49,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:49:49,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1946897819, now seen corresponding path program 1 times [2025-03-17 14:49:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083672259] [2025-03-17 14:49:49,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:49:49,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:49:49,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:49,788 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-17 14:49:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083672259] [2025-03-17 14:49:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083672259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:49:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788033005] [2025-03-17 14:49:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:49,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:49,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,789 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:49,803 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-17 14:49:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:49,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 14:49:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:49,804 INFO L225 Difference]: With dead ends: 26 [2025-03-17 14:49:49,804 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 14:49:49,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,805 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:49,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 14:49:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 14:49:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 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-17 14:49:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-03-17 14:49:49,808 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 8 [2025-03-17 14:49:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:49,808 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-03-17 14:49:49,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-03-17 14:49:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:49:49,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,809 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:49:49,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:49:49,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash 794553659, now seen corresponding path program 1 times [2025-03-17 14:49:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505447780] [2025-03-17 14:49:49,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:49:49,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:49:49,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:49,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:49,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505447780] [2025-03-17 14:49:49,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505447780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:49,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:49,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:49:49,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692834157] [2025-03-17 14:49:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:49,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:49:49,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:49,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:49:49,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:49:49,872 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-17 14:49:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:49,889 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-03-17 14:49:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:49:49,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-17 14:49:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:49,891 INFO L225 Difference]: With dead ends: 41 [2025-03-17 14:49:49,891 INFO L226 Difference]: Without dead ends: 17 [2025-03-17 14:49:49,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:49:49,892 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:49,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-17 14:49:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-17 14:49:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-17 14:49:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-03-17 14:49:49,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2025-03-17 14:49:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:49,898 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-17 14:49:49,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-17 14:49:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-03-17 14:49:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:49:49,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:49:49,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:49:49,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 794554013, now seen corresponding path program 1 times [2025-03-17 14:49:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451995974] [2025-03-17 14:49:49,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:49:49,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:49:49,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:49:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451995974] [2025-03-17 14:49:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451995974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:49:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398549242] [2025-03-17 14:49:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,942 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 14:49:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:49,956 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-03-17 14:49:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:49,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-03-17 14:49:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:49,957 INFO L225 Difference]: With dead ends: 33 [2025-03-17 14:49:49,957 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:49:49,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:49,958 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 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-17 14:49:49,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:49:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-17 14:49:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 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-17 14:49:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-17 14:49:49,964 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2025-03-17 14:49:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:49,964 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-17 14:49:49,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 14:49:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-17 14:49:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:49:49,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:49,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:49:49,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:49:49,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:49,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash -938150542, now seen corresponding path program 1 times [2025-03-17 14:49:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922616560] [2025-03-17 14:49:49,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:49,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:49:49,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:49:49,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:49,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:50,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922616560] [2025-03-17 14:49:50,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922616560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:50,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146259100] [2025-03-17 14:49:50,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:50,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:49:50,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:49:50,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:49:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:49:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:50,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:49:50,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:49:50,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146259100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:50,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 5] total 9 [2025-03-17 14:49:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673345394] [2025-03-17 14:49:50,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:50,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:49:50,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:50,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:49:50,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:49:50,221 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 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-17 14:49:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:50,259 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-17 14:49:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:49:50,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 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 13 [2025-03-17 14:49:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:50,260 INFO L225 Difference]: With dead ends: 31 [2025-03-17 14:49:50,260 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 14:49:50,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:49:50,261 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:50,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 14:49:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-03-17 14:49:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-17 14:49:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-17 14:49:50,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2025-03-17 14:49:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:50,268 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-17 14:49:50,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 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-17 14:49:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-17 14:49:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 14:49:50,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:50,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 14:49:50,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:49:50,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:50,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:50,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1536654656, now seen corresponding path program 1 times [2025-03-17 14:49:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265014407] [2025-03-17 14:49:50,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:50,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:49:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:49:50,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:50,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:49:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265014407] [2025-03-17 14:49:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265014407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799707866] [2025-03-17 14:49:50,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:50,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:50,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:49:50,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:49:50,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:49:50,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:49:50,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:50,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:50,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:49:50,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:49:50,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:49:50,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799707866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:50,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:50,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:49:50,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179689142] [2025-03-17 14:49:50,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:50,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:49:50,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:50,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:49:50,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:49:50,624 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 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-17 14:49:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:50,643 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-03-17 14:49:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:49:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 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 21 [2025-03-17 14:49:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:50,644 INFO L225 Difference]: With dead ends: 53 [2025-03-17 14:49:50,644 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:49:50,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-17 14:49:50,644 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:50,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:49:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 14:49:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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-17 14:49:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-17 14:49:50,649 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2025-03-17 14:49:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:50,650 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-17 14:49:50,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 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-17 14:49:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-17 14:49:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 14:49:50,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:50,651 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2025-03-17 14:49:50,658 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-17 14:49:50,851 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-17 14:49:50,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:50,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1016411479, now seen corresponding path program 2 times [2025-03-17 14:49:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:50,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581405117] [2025-03-17 14:49:50,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:49:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:50,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 14:49:50,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:49:50,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:49:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:49:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:50,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581405117] [2025-03-17 14:49:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581405117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:50,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889608453] [2025-03-17 14:49:50,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:49:50,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:50,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:50,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:49:50,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:49:50,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 14:49:51,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:49:51,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:49:51,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:51,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:49:51,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:49:51,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:49:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889608453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:51,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:49:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004274302] [2025-03-17 14:49:51,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:49:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:51,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:49:51,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:49:51,199 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-17 14:49:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:51,244 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-03-17 14:49:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:49:51,245 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-17 14:49:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:51,246 INFO L225 Difference]: With dead ends: 113 [2025-03-17 14:49:51,246 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 14:49:51,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 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-17 14:49:51,246 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:51,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 14:49:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 14:49:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 111 states have internal predecessors, (123), 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-17 14:49:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-03-17 14:49:51,262 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 51 [2025-03-17 14:49:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:51,263 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-03-17 14:49:51,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-17 14:49:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-03-17 14:49:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 14:49:51,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:51,267 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1] [2025-03-17 14:49:51,273 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-17 14:49:51,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:51,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:51,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:51,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1668539333, now seen corresponding path program 3 times [2025-03-17 14:49:51,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:51,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378230924] [2025-03-17 14:49:51,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:49:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:51,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 15 equivalence classes. [2025-03-17 14:49:51,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 14:49:51,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 14:49:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:49:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378230924] [2025-03-17 14:49:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378230924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404717912] [2025-03-17 14:49:51,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:49:51,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:51,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:51,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:49:51,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:49:51,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 15 equivalence classes. [2025-03-17 14:49:51,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 14:49:51,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 14:49:51,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:51,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:49:51,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:49:51,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 14:49:52,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404717912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:52,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:52,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 14:49:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640546343] [2025-03-17 14:49:52,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:52,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 14:49:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:52,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 14:49:52,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:49:52,227 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 24 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 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-17 14:49:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:52,297 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2025-03-17 14:49:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:49:52,297 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 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 111 [2025-03-17 14:49:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:52,299 INFO L225 Difference]: With dead ends: 233 [2025-03-17 14:49:52,299 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 14:49:52,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:49:52,300 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:52,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 14:49:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-17 14:49:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.103896103896104) internal successors, (255), 231 states have internal predecessors, (255), 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-17 14:49:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 255 transitions. [2025-03-17 14:49:52,313 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 255 transitions. Word has length 111 [2025-03-17 14:49:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:52,313 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 255 transitions. [2025-03-17 14:49:52,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 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-17 14:49:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 255 transitions. [2025-03-17 14:49:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 14:49:52,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:52,315 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1] [2025-03-17 14:49:52,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:49:52,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:52,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:52,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 512580191, now seen corresponding path program 4 times [2025-03-17 14:49:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:52,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423216905] [2025-03-17 14:49:52,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:49:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:52,533 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 231 statements into 2 equivalence classes. [2025-03-17 14:49:52,564 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 14:49:52,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:49:52,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3059 backedges. 0 proven. 3036 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:49:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423216905] [2025-03-17 14:49:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423216905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:53,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382354000] [2025-03-17 14:49:53,276 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:49:53,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:53,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:53,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:49:53,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:49:53,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 231 statements into 2 equivalence classes. [2025-03-17 14:49:53,355 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 14:49:53,355 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:49:53,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:53,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 14:49:53,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3059 backedges. 0 proven. 3036 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:49:53,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3059 backedges. 0 proven. 3036 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:49:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382354000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:54,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 14:49:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487922280] [2025-03-17 14:49:54,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:49:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:54,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:49:54,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:49:54,548 INFO L87 Difference]: Start difference. First operand 232 states and 255 transitions. Second operand has 48 states, 47 states have (on average 9.829787234042554) internal successors, (462), 47 states have internal predecessors, (462), 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-17 14:49:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:54,680 INFO L93 Difference]: Finished difference Result 473 states and 543 transitions. [2025-03-17 14:49:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 14:49:54,680 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 9.829787234042554) internal successors, (462), 47 states have internal predecessors, (462), 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 231 [2025-03-17 14:49:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:54,683 INFO L225 Difference]: With dead ends: 473 [2025-03-17 14:49:54,683 INFO L226 Difference]: Without dead ends: 472 [2025-03-17 14:49:54,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:49:54,684 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:54,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:49:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-17 14:49:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-17 14:49:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.1019108280254777) internal successors, (519), 471 states have internal predecessors, (519), 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-17 14:49:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2025-03-17 14:49:54,717 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 231 [2025-03-17 14:49:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:54,717 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2025-03-17 14:49:54,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 9.829787234042554) internal successors, (462), 47 states have internal predecessors, (462), 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-17 14:49:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2025-03-17 14:49:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-17 14:49:54,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:54,723 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 46, 1, 1] [2025-03-17 14:49:54,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:49:54,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:49:54,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:49:54,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1639431513, now seen corresponding path program 5 times [2025-03-17 14:49:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316448136] [2025-03-17 14:49:54,928 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:49:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:54,942 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 471 statements into 59 equivalence classes. [2025-03-17 14:49:55,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) and asserted 471 of 471 statements. [2025-03-17 14:49:55,027 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2025-03-17 14:49:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13019 backedges. 0 proven. 12972 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-17 14:49:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316448136] [2025-03-17 14:49:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316448136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073752784] [2025-03-17 14:49:57,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:49:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:57,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:49:57,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:49:57,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 471 statements into 59 equivalence classes. [2025-03-17 14:49:57,464 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) and asserted 471 of 471 statements. [2025-03-17 14:49:57,464 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2025-03-17 14:49:57,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:57,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 14:49:57,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13019 backedges. 0 proven. 12972 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-17 14:49:57,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:50:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 13019 backedges. 0 proven. 12972 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-17 14:50:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073752784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:50:00,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:50:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-17 14:50:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723658792] [2025-03-17 14:50:00,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:50:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-17 14:50:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:50:00,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 14:50:00,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:50:00,187 INFO L87 Difference]: Start difference. First operand 472 states and 519 transitions. Second operand has 96 states, 95 states have (on average 9.91578947368421) internal successors, (942), 95 states have internal predecessors, (942), 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-17 14:50:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:50:00,622 INFO L93 Difference]: Finished difference Result 953 states and 1095 transitions. [2025-03-17 14:50:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 14:50:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 9.91578947368421) internal successors, (942), 95 states have internal predecessors, (942), 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 471 [2025-03-17 14:50:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:50:00,628 INFO L225 Difference]: With dead ends: 953 [2025-03-17 14:50:00,628 INFO L226 Difference]: Without dead ends: 952 [2025-03-17 14:50:00,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:50:00,631 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:50:00,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 762 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:50:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-03-17 14:50:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2025-03-17 14:50:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 1.1009463722397477) internal successors, (1047), 951 states have internal predecessors, (1047), 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-17 14:50:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1047 transitions. [2025-03-17 14:50:00,657 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1047 transitions. Word has length 471 [2025-03-17 14:50:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:50:00,659 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1047 transitions. [2025-03-17 14:50:00,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 9.91578947368421) internal successors, (942), 95 states have internal predecessors, (942), 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-17 14:50:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1047 transitions. [2025-03-17 14:50:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2025-03-17 14:50:00,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:50:00,673 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 95, 95, 95, 94, 1, 1] [2025-03-17 14:50:00,680 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-17 14:50:00,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:50:00,876 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:50:00,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:50:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash -728775881, now seen corresponding path program 6 times [2025-03-17 14:50:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:50:00,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642223399] [2025-03-17 14:50:00,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:50:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:50:00,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 951 statements into 119 equivalence classes. [2025-03-17 14:50:01,044 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 119 check-sat command(s) and asserted 951 of 951 statements. [2025-03-17 14:50:01,044 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 119 check-sat command(s) [2025-03-17 14:50:01,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 53675 backedges. 0 proven. 53580 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 14:50:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:50:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642223399] [2025-03-17 14:50:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642223399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:50:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48577841] [2025-03-17 14:50:07,802 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:50:07,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:50:07,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:50:07,804 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:50:07,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:50:07,880 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 951 statements into 119 equivalence classes. [2025-03-17 14:50:08,211 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 119 check-sat command(s) and asserted 951 of 951 statements. [2025-03-17 14:50:08,211 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 119 check-sat command(s) [2025-03-17 14:50:08,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:08,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 14:50:08,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:50:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 53675 backedges. 0 proven. 53580 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 14:50:08,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:50:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 53675 backedges. 0 proven. 53580 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 14:50:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48577841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:50:17,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:50:17,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-03-17 14:50:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350212289] [2025-03-17 14:50:17,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:50:17,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-17 14:50:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:50:17,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-17 14:50:17,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 14:50:17,024 INFO L87 Difference]: Start difference. First operand 952 states and 1047 transitions. Second operand has 192 states, 191 states have (on average 9.958115183246074) internal successors, (1902), 191 states have internal predecessors, (1902), 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-17 14:50:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:50:18,614 INFO L93 Difference]: Finished difference Result 1913 states and 2199 transitions. [2025-03-17 14:50:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-17 14:50:18,615 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 9.958115183246074) internal successors, (1902), 191 states have internal predecessors, (1902), 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 951 [2025-03-17 14:50:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:50:18,621 INFO L225 Difference]: With dead ends: 1913 [2025-03-17 14:50:18,621 INFO L226 Difference]: Without dead ends: 1912 [2025-03-17 14:50:18,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1805 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 14:50:18,623 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:50:18,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1530 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:50:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-03-17 14:50:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1912. [2025-03-17 14:50:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1911 states have (on average 1.1004709576138147) internal successors, (2103), 1911 states have internal predecessors, (2103), 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-17 14:50:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2103 transitions. [2025-03-17 14:50:18,696 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2103 transitions. Word has length 951 [2025-03-17 14:50:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:50:18,697 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 2103 transitions. [2025-03-17 14:50:18,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 9.958115183246074) internal successors, (1902), 191 states have internal predecessors, (1902), 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-17 14:50:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2103 transitions. [2025-03-17 14:50:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1912 [2025-03-17 14:50:18,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:50:18,750 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 191, 191, 191, 191, 191, 190, 1, 1] [2025-03-17 14:50:18,760 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-17 14:50:18,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:50:18,951 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:50:18,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:50:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2078639191, now seen corresponding path program 7 times [2025-03-17 14:50:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:50:18,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883571533] [2025-03-17 14:50:18,952 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:50:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:50:18,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1911 statements into 1 equivalence classes. [2025-03-17 14:50:19,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1911 of 1911 statements. [2025-03-17 14:50:19,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:50:19,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 217931 backedges. 0 proven. 217740 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-17 14:50:52,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:50:52,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883571533] [2025-03-17 14:50:52,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883571533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:50:52,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062900756] [2025-03-17 14:50:52,687 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:50:52,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:50:52,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:50:52,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:50:52,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:50:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1911 statements into 1 equivalence classes. [2025-03-17 14:50:53,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1911 of 1911 statements. [2025-03-17 14:50:53,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:50:53,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:53,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 3826 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-17 14:50:53,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:50:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 217931 backedges. 0 proven. 217740 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-17 14:50:54,487 INFO L312 TraceCheckSpWp]: Computing backward predicates...