./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/b.06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/b.06.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 cec1cb80cc444268f4d15edbfcfbc42fd6cec25bcc627308222b3bf585ff5fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:48:20,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:48:20,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:48:20,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:48:20,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:48:20,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:48:20,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:48:20,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:48:20,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:48:20,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:48:20,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:48:20,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:48:20,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:48:20,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:48:20,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:48:20,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:48:20,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:48:20,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:48:20,704 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 -> cec1cb80cc444268f4d15edbfcfbc42fd6cec25bcc627308222b3bf585ff5fd0 [2025-03-09 01:48:20,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:48:20,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:48:20,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:48:20,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:48:20,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:48:20,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/b.06.c [2025-03-09 01:48:22,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb133f551/b9b53348fa9e4192852712a0a77c9758/FLAGfe45fb3d7 [2025-03-09 01:48:22,272 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:48:22,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.06.c [2025-03-09 01:48:22,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb133f551/b9b53348fa9e4192852712a0a77c9758/FLAGfe45fb3d7 [2025-03-09 01:48:22,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb133f551/b9b53348fa9e4192852712a0a77c9758 [2025-03-09 01:48:22,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:48:22,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:48:22,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:48:22,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:48:22,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:48:22,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46352ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22, skipping insertion in model container [2025-03-09 01:48:22,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:48:22,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:48:22,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:48:22,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:48:22,831 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:48:22,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22 WrapperNode [2025-03-09 01:48:22,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:48:22,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:48:22,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:48:22,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:48:22,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,848 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-03-09 01:48:22,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:48:22,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:48:22,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:48:22,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:48:22,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,858 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 01:48:22,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:48:22,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:48:22,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:48:22,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:48:22,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (1/1) ... [2025-03-09 01:48:22,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:48:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:48:22,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:48:22,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:48:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:48:22,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:48:22,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:48:22,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:48:23,022 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-09 01:48:23,022 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:48:23,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:48:23,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:48:23,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:48:23 BoogieIcfgContainer [2025-03-09 01:48:23,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:48:23,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:48:23,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:48:23,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:48:23,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:48:22" (1/3) ... [2025-03-09 01:48:23,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a6eea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:48:23, skipping insertion in model container [2025-03-09 01:48:23,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:48:22" (2/3) ... [2025-03-09 01:48:23,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a6eea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:48:23, skipping insertion in model container [2025-03-09 01:48:23,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:48:23" (3/3) ... [2025-03-09 01:48:23,036 INFO L128 eAbstractionObserver]: Analyzing ICFG b.06.c [2025-03-09 01:48:23,047 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:48:23,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.06.c that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-09 01:48:23,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:48:23,102 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;@67ff24dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:48:23,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:48:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 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-09 01:48:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:48:23,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:48:23,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:23,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1445823, now seen corresponding path program 1 times [2025-03-09 01:48:23,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:23,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683970716] [2025-03-09 01:48:23,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:23,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:48:23,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:48:23,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683970716] [2025-03-09 01:48:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683970716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:48:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:48:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:48:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187977405] [2025-03-09 01:48:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:48:23,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:48:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:23,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:48:23,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,249 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:23,273 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-09 01:48:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:48:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 01:48:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:23,281 INFO L225 Difference]: With dead ends: 18 [2025-03-09 01:48:23,281 INFO L226 Difference]: Without dead ends: 14 [2025-03-09 01:48:23,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,284 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:23,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-09 01:48:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 01:48:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-09 01:48:23,306 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2025-03-09 01:48:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:23,306 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-09 01:48:23,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-09 01:48:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:48:23,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:48:23,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:48:23,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:23,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:23,308 INFO L85 PathProgramCache]: Analyzing trace with hash 44820494, now seen corresponding path program 1 times [2025-03-09 01:48:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:23,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760708035] [2025-03-09 01:48:23,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:23,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:48:23,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:48:23,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760708035] [2025-03-09 01:48:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760708035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:48:23,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:48:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:48:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651826566] [2025-03-09 01:48:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:48:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:48:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:23,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:48:23,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,337 INFO L87 Difference]: Start difference. First operand 14 states and 14 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-09 01:48:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:23,344 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-09 01:48:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:48:23,345 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-09 01:48:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:23,345 INFO L225 Difference]: With dead ends: 14 [2025-03-09 01:48:23,346 INFO L226 Difference]: Without dead ends: 13 [2025-03-09 01:48:23,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,347 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:23,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-09 01:48:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-09 01:48:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-09 01:48:23,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2025-03-09 01:48:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:23,351 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-09 01:48:23,351 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-09 01:48:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-09 01:48:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:48:23,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:48:23,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:48:23,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:23,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1389435293, now seen corresponding path program 1 times [2025-03-09 01:48:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831580742] [2025-03-09 01:48:23,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:23,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:48:23,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:48:23,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:23,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831580742] [2025-03-09 01:48:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831580742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:48:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:48:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:48:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609528830] [2025-03-09 01:48:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:48:23,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:48:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:23,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:48:23,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,391 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 3.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-09 01:48:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:23,402 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-09 01:48:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:48:23,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 01:48:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:23,403 INFO L225 Difference]: With dead ends: 13 [2025-03-09 01:48:23,403 INFO L226 Difference]: Without dead ends: 12 [2025-03-09 01:48:23,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,404 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:23,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-09 01:48:23,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-09 01:48:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-09 01:48:23,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2025-03-09 01:48:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:23,412 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-09 01:48:23,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-09 01:48:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:48:23,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:48:23,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:48:23,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:23,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 122821100, now seen corresponding path program 1 times [2025-03-09 01:48:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377118680] [2025-03-09 01:48:23,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:23,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:48:23,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:48:23,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:23,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377118680] [2025-03-09 01:48:23,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377118680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:48:23,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:48:23,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:48:23,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099156466] [2025-03-09 01:48:23,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:48:23,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:48:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:23,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:48:23,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,447 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:23,452 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-03-09 01:48:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:48:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 01:48:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:23,453 INFO L225 Difference]: With dead ends: 12 [2025-03-09 01:48:23,453 INFO L226 Difference]: Without dead ends: 11 [2025-03-09 01:48:23,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,453 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:23,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-09 01:48:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-09 01:48:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 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-09 01:48:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-09 01:48:23,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-09 01:48:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:23,457 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-09 01:48:23,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-09 01:48:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:48:23,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:48:23,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:48:23,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:23,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash -487513221, now seen corresponding path program 1 times [2025-03-09 01:48:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:23,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413597321] [2025-03-09 01:48:23,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:23,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:48:23,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:48:23,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:23,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413597321] [2025-03-09 01:48:23,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413597321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:48:23,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:48:23,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:48:23,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939003219] [2025-03-09 01:48:23,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:48:23,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:48:23,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:23,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:48:23,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,493 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:23,505 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2025-03-09 01:48:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:48:23,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:48:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:23,506 INFO L225 Difference]: With dead ends: 11 [2025-03-09 01:48:23,506 INFO L226 Difference]: Without dead ends: 10 [2025-03-09 01:48:23,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,506 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:23,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-09 01:48:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-09 01:48:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-09 01:48:23,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2025-03-09 01:48:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-09 01:48:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-09 01:48:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:48:23,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:48:23,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:48:23,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:23,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2066959306, now seen corresponding path program 1 times [2025-03-09 01:48:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233333817] [2025-03-09 01:48:23,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:23,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:48:23,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:48:23,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:23,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233333817] [2025-03-09 01:48:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233333817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:48:23,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:48:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:48:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116129477] [2025-03-09 01:48:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:48:23,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:48:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:23,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:48:23,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,547 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:23,557 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-09 01:48:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:48:23,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-03-09 01:48:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:23,557 INFO L225 Difference]: With dead ends: 18 [2025-03-09 01:48:23,557 INFO L226 Difference]: Without dead ends: 17 [2025-03-09 01:48:23,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:48:23,558 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 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-09 01:48:23,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-09 01:48:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-09 01:48:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-09 01:48:23,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 9 [2025-03-09 01:48:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:23,561 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-09 01:48:23,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-09 01:48:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:48:23,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:48:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:48:23,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash -844481087, now seen corresponding path program 1 times [2025-03-09 01:48:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506464663] [2025-03-09 01:48:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:23,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:48:23,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:48:23,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506464663] [2025-03-09 01:48:23,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506464663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:48:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581517919] [2025-03-09 01:48:23,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:48:23,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:23,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:48:23,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:48:23,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:48:23,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:48:23,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:48:23,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:23,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:23,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:48:23,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:48:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:48:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581517919] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:48:23,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:48:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:48:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217590119] [2025-03-09 01:48:23,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:48:23,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:48:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:23,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:48:23,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:48:23,784 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:23,805 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-09 01:48:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:48:23,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 16 [2025-03-09 01:48:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:23,806 INFO L225 Difference]: With dead ends: 39 [2025-03-09 01:48:23,806 INFO L226 Difference]: Without dead ends: 38 [2025-03-09 01:48:23,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-09 01:48:23,806 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:23,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-09 01:48:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-09 01:48:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2025-03-09 01:48:23,814 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 16 [2025-03-09 01:48:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:23,814 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2025-03-09 01:48:23,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2025-03-09 01:48:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 01:48:23,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:23,815 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-03-09 01:48:23,822 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-09 01:48:24,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:24,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:24,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash -794432502, now seen corresponding path program 2 times [2025-03-09 01:48:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:24,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424517360] [2025-03-09 01:48:24,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:48:24,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:24,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:48:24,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:48:24,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:48:24,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424517360] [2025-03-09 01:48:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424517360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:48:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530559128] [2025-03-09 01:48:24,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:48:24,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:24,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:48:24,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:48:24,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:48:24,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:48:24,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:48:24,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:48:24,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:24,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:48:24,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:48:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:24,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:48:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530559128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:48:24,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:48:24,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 01:48:24,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422564897] [2025-03-09 01:48:24,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:48:24,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:48:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:24,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:48:24,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:48:24,348 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:24,387 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-03-09 01:48:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:48:24,389 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 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 37 [2025-03-09 01:48:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:24,389 INFO L225 Difference]: With dead ends: 81 [2025-03-09 01:48:24,389 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 01:48:24,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 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-09 01:48:24,390 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 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-09 01:48:24,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:48:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 01:48:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-09 01:48:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2025-03-09 01:48:24,397 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 37 [2025-03-09 01:48:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:24,398 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2025-03-09 01:48:24,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2025-03-09 01:48:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 01:48:24,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:24,400 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 1, 1, 1] [2025-03-09 01:48:24,406 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-09 01:48:24,602 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,SelfDestructingSolverStorable7 [2025-03-09 01:48:24,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1001388138, now seen corresponding path program 3 times [2025-03-09 01:48:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015599181] [2025-03-09 01:48:24,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:48:24,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:24,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-03-09 01:48:24,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 01:48:24,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:48:24,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:24,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015599181] [2025-03-09 01:48:24,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015599181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:48:24,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654448220] [2025-03-09 01:48:24,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:48:24,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:24,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:48:24,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:48:24,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:48:24,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-03-09 01:48:24,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 01:48:24,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:48:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:24,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:48:24,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:48:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:24,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:48:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:25,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654448220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:48:25,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:48:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-09 01:48:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181453048] [2025-03-09 01:48:25,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:48:25,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:48:25,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:25,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:48:25,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:48:25,290 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 24 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:25,363 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2025-03-09 01:48:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:48:25,364 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 24 states have internal predecessors, (157), 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 79 [2025-03-09 01:48:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:25,365 INFO L225 Difference]: With dead ends: 165 [2025-03-09 01:48:25,365 INFO L226 Difference]: Without dead ends: 164 [2025-03-09 01:48:25,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 146 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-09 01:48:25,365 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:25,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:48:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-09 01:48:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-09 01:48:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.0061349693251533) internal successors, (164), 163 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2025-03-09 01:48:25,373 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 79 [2025-03-09 01:48:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:25,373 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2025-03-09 01:48:25,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 24 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2025-03-09 01:48:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-09 01:48:25,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:25,375 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 1, 1, 1] [2025-03-09 01:48:25,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:48:25,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:25,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:25,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2083935958, now seen corresponding path program 4 times [2025-03-09 01:48:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:25,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403090725] [2025-03-09 01:48:25,580 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:48:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:25,590 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 163 statements into 2 equivalence classes. [2025-03-09 01:48:25,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-03-09 01:48:25,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:48:25,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403090725] [2025-03-09 01:48:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403090725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:48:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789728686] [2025-03-09 01:48:26,190 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:48:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:48:26,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:48:26,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:48:26,226 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 163 statements into 2 equivalence classes. [2025-03-09 01:48:26,264 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-03-09 01:48:26,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:48:26,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:26,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 01:48:26,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:48:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:26,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:48:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789728686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:48:27,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:48:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-09 01:48:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028920315] [2025-03-09 01:48:27,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:48:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 01:48:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 01:48:27,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:48:27,219 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand has 48 states, 47 states have (on average 6.914893617021277) internal successors, (325), 48 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:27,371 INFO L93 Difference]: Finished difference Result 333 states and 356 transitions. [2025-03-09 01:48:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 01:48:27,371 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.914893617021277) internal successors, (325), 48 states have internal predecessors, (325), 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 163 [2025-03-09 01:48:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:27,374 INFO L225 Difference]: With dead ends: 333 [2025-03-09 01:48:27,374 INFO L226 Difference]: Without dead ends: 332 [2025-03-09 01:48:27,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:48:27,375 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:27,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:48:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-09 01:48:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-09 01:48:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.0030211480362539) internal successors, (332), 331 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2025-03-09 01:48:27,389 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 163 [2025-03-09 01:48:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:27,389 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2025-03-09 01:48:27,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.914893617021277) internal successors, (325), 48 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2025-03-09 01:48:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-09 01:48:27,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:27,394 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 1, 1, 1] [2025-03-09 01:48:27,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:48:27,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:27,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:27,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1257990826, now seen corresponding path program 5 times [2025-03-09 01:48:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:27,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708659483] [2025-03-09 01:48:27,597 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:48:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:27,618 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 47 equivalence classes. [2025-03-09 01:48:27,756 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 331 of 331 statements. [2025-03-09 01:48:27,756 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 01:48:27,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708659483] [2025-03-09 01:48:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708659483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:48:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219332400] [2025-03-09 01:48:29,594 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:48:29,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:29,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:48:29,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:48:29,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:48:29,625 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 47 equivalence classes. [2025-03-09 01:48:29,713 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 331 of 331 statements. [2025-03-09 01:48:29,713 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 01:48:29,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:29,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 01:48:29,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:48:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:30,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:48:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219332400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:48:32,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:48:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-09 01:48:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472965455] [2025-03-09 01:48:32,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:48:32,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-09 01:48:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:32,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-09 01:48:32,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 01:48:32,470 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand has 96 states, 95 states have (on average 6.957894736842105) internal successors, (661), 96 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:32,801 INFO L93 Difference]: Finished difference Result 669 states and 716 transitions. [2025-03-09 01:48:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-09 01:48:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 6.957894736842105) internal successors, (661), 96 states have internal predecessors, (661), 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 331 [2025-03-09 01:48:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:32,804 INFO L225 Difference]: With dead ends: 669 [2025-03-09 01:48:32,804 INFO L226 Difference]: Without dead ends: 668 [2025-03-09 01:48:32,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 01:48:32,808 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:48:32,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:48:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-09 01:48:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-03-09 01:48:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.0014992503748126) internal successors, (668), 667 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 668 transitions. [2025-03-09 01:48:32,835 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 668 transitions. Word has length 331 [2025-03-09 01:48:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:32,835 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 668 transitions. [2025-03-09 01:48:32,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 6.957894736842105) internal successors, (661), 96 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 668 transitions. [2025-03-09 01:48:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-09 01:48:32,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:32,844 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 94, 1, 1, 1] [2025-03-09 01:48:32,852 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-09 01:48:33,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:48:33,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:33,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1889037738, now seen corresponding path program 6 times [2025-03-09 01:48:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737199117] [2025-03-09 01:48:33,050 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:48:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:33,070 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 667 statements into 95 equivalence classes. [2025-03-09 01:48:33,178 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 667 of 667 statements. [2025-03-09 01:48:33,178 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-09 01:48:33,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:48:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737199117] [2025-03-09 01:48:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737199117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:48:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514090256] [2025-03-09 01:48:38,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:48:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:48:38,753 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:48:38,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:48:38,793 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 667 statements into 95 equivalence classes. [2025-03-09 01:48:38,990 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 667 of 667 statements. [2025-03-09 01:48:38,990 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-09 01:48:38,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:48:38,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-09 01:48:39,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:48:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:39,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:48:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:48:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514090256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:48:46,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:48:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-09 01:48:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604596253] [2025-03-09 01:48:46,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:48:46,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-09 01:48:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:48:46,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-09 01:48:46,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-09 01:48:46,895 INFO L87 Difference]: Start difference. First operand 668 states and 668 transitions. Second operand has 192 states, 191 states have (on average 6.979057591623037) internal successors, (1333), 192 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:48:47,879 INFO L93 Difference]: Finished difference Result 1341 states and 1436 transitions. [2025-03-09 01:48:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-09 01:48:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 6.979057591623037) internal successors, (1333), 192 states have internal predecessors, (1333), 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 667 [2025-03-09 01:48:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:48:47,884 INFO L225 Difference]: With dead ends: 1341 [2025-03-09 01:48:47,884 INFO L226 Difference]: Without dead ends: 1340 [2025-03-09 01:48:47,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1428 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-09 01:48:47,887 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 962 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-09 01:48:47,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 962 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:48:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-03-09 01:48:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2025-03-09 01:48:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 1.0007468259895445) internal successors, (1340), 1339 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1340 transitions. [2025-03-09 01:48:47,916 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1340 transitions. Word has length 667 [2025-03-09 01:48:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:48:47,917 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1340 transitions. [2025-03-09 01:48:47,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 6.979057591623037) internal successors, (1333), 192 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:48:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1340 transitions. [2025-03-09 01:48:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2025-03-09 01:48:47,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:48:47,948 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 191, 191, 190, 1, 1, 1] [2025-03-09 01:48:47,957 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-09 01:48:48,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:48:48,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:48:48,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:48:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash 850949034, now seen corresponding path program 7 times [2025-03-09 01:48:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:48:48,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56534470] [2025-03-09 01:48:48,149 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:48:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:48:48,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-03-09 01:48:48,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-03-09 01:48:48,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:48:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:49:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:49:12,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:49:12,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56534470] [2025-03-09 01:49:12,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56534470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:49:12,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202760447] [2025-03-09 01:49:12,695 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:49:12,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:49:12,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:49:12,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:49:12,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:49:12,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-03-09 01:49:12,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-03-09 01:49:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:49:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:49:12,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 2681 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-09 01:49:13,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:49:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:49:13,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:49:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:49:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202760447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:49:44,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:49:44,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-03-09 01:49:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477408232] [2025-03-09 01:49:44,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:49:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-09 01:49:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:49:44,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-09 01:49:44,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-09 01:49:44,240 INFO L87 Difference]: Start difference. First operand 1340 states and 1340 transitions. Second operand has 384 states, 383 states have (on average 6.989556135770235) internal successors, (2677), 384 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:49:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:49:51,124 INFO L93 Difference]: Finished difference Result 2685 states and 2876 transitions. [2025-03-09 01:49:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-03-09 01:49:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 6.989556135770235) internal successors, (2677), 384 states have internal predecessors, (2677), 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 1339 [2025-03-09 01:49:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:49:51,135 INFO L225 Difference]: With dead ends: 2685 [2025-03-09 01:49:51,135 INFO L226 Difference]: Without dead ends: 2684 [2025-03-09 01:49:51,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2868 GetRequests, 2486 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-09 01:49:51,141 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:49:51,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1927 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:49:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2025-03-09 01:49:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2025-03-09 01:49:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2684 states, 2683 states have (on average 1.0003727171077152) internal successors, (2684), 2683 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:49:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 2684 transitions. [2025-03-09 01:49:51,179 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 2684 transitions. Word has length 1339 [2025-03-09 01:49:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:49:51,181 INFO L471 AbstractCegarLoop]: Abstraction has 2684 states and 2684 transitions. [2025-03-09 01:49:51,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 6.989556135770235) internal successors, (2677), 384 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:49:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 2684 transitions. [2025-03-09 01:49:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2684 [2025-03-09 01:49:51,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:49:51,211 INFO L218 NwaCegarLoop]: trace histogram [383, 383, 383, 383, 383, 383, 382, 1, 1, 1] [2025-03-09 01:49:51,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:49:51,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:49:51,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:49:51,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:49:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1653637034, now seen corresponding path program 8 times [2025-03-09 01:49:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:49:51,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803949786] [2025-03-09 01:49:51,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:49:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:49:51,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2683 statements into 2 equivalence classes. [2025-03-09 01:49:52,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2683 of 2683 statements. [2025-03-09 01:49:52,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:49:52,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat