./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.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 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:47:52,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:47:52,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:47:52,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:47:52,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:47:52,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:47:52,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:47:52,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:47:52,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:47:52,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:47:52,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:47:52,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:47:52,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:47:52,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:47:52,369 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:47:52,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:47:52,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:47:52,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:47:52,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:47:52,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:47:52,375 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 -> 33be026e9ca846df0a8faa91fc9c2bbf64ee20dbba0f4f48a9cd42fbefb372d5 [2025-03-17 14:47:52,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:47:52,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:47:52,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:47:52,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:47:52,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:47:52,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2025-03-17 14:47:53,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9a4ba3f/336dc24bbed64714a54abcfa27ce7148/FLAGd4367dd61 [2025-03-17 14:47:54,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:47:54,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2025-03-17 14:47:54,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9a4ba3f/336dc24bbed64714a54abcfa27ce7148/FLAGd4367dd61 [2025-03-17 14:47:54,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9a4ba3f/336dc24bbed64714a54abcfa27ce7148 [2025-03-17 14:47:54,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:47:54,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:47:54,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:47:54,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:47:54,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:47:54,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11373edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54, skipping insertion in model container [2025-03-17 14:47:54,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:47:54,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:47:54,831 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:47:54,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:47:54,850 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:47:54,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54 WrapperNode [2025-03-17 14:47:54,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:47:54,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:47:54,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:47:54,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:47:54,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,874 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2025-03-17 14:47:54,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:47:54,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:47:54,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:47:54,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:47:54,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,888 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:47:54,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:47:54,894 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:47:54,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:47:54,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:47:54,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (1/1) ... [2025-03-17 14:47:54,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:47:54,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:54,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:47:54,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:47:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:47:54,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:47:54,991 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:47:54,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:47:55,065 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 14:47:55,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:47:55,071 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:47:55,071 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:47:55,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:55 BoogieIcfgContainer [2025-03-17 14:47:55,071 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:47:55,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:47:55,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:47:55,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:47:55,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:47:54" (1/3) ... [2025-03-17 14:47:55,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e7adf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:55, skipping insertion in model container [2025-03-17 14:47:55,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:54" (2/3) ... [2025-03-17 14:47:55,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e7adf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:55, skipping insertion in model container [2025-03-17 14:47:55,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:55" (3/3) ... [2025-03-17 14:47:55,078 INFO L128 eAbstractionObserver]: Analyzing ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c [2025-03-17 14:47:55,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:47:55,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-17 14:47:55,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:47:55,132 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;@7110c5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:47:55,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:47:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:47:55,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:47:55,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1629502, now seen corresponding path program 1 times [2025-03-17 14:47:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179659176] [2025-03-17 14:47:55,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:55,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:47:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:47:55,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179659176] [2025-03-17 14:47:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179659176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:55,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:47:55,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330428946] [2025-03-17 14:47:55,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:55,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:55,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:55,274 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-17 14:47:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:55,312 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-17 14:47:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:55,314 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-17 14:47:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:55,318 INFO L225 Difference]: With dead ends: 28 [2025-03-17 14:47:55,318 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 14:47:55,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:55,321 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:55,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 14:47:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-17 14:47:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-17 14:47:55,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2025-03-17 14:47:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:55,342 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-17 14:47:55,342 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-17 14:47:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-17 14:47:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:47:55,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:47:55,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:47:55,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash 50514547, now seen corresponding path program 1 times [2025-03-17 14:47:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030934411] [2025-03-17 14:47:55,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:55,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:47:55,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:47:55,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:55,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030934411] [2025-03-17 14:47:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030934411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:55,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:47:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233963233] [2025-03-17 14:47:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:55,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:55,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:55,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:55,390 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:55,416 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-03-17 14:47:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:55,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 14:47:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:55,417 INFO L225 Difference]: With dead ends: 22 [2025-03-17 14:47:55,417 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 14:47:55,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:55,418 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:55,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 14:47:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 14:47:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-17 14:47:55,424 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2025-03-17 14:47:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:55,425 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-17 14:47:55,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-17 14:47:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:47:55,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:55,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:47:55,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1299838865, now seen corresponding path program 1 times [2025-03-17 14:47:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788768734] [2025-03-17 14:47:55,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:47:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:47:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788768734] [2025-03-17 14:47:55,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788768734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:55,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:55,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:47:55,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111386183] [2025-03-17 14:47:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:55,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:47:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:55,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:47:55,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:55,481 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:55,536 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-17 14:47:55,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:47:55,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:47:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:55,537 INFO L225 Difference]: With dead ends: 43 [2025-03-17 14:47:55,537 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 14:47:55,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:55,537 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:55,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 14:47:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2025-03-17 14:47:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2025-03-17 14:47:55,541 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 7 [2025-03-17 14:47:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-17 14:47:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2025-03-17 14:47:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:47:55,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:55,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:47:55,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1299838888, now seen corresponding path program 1 times [2025-03-17 14:47:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890263090] [2025-03-17 14:47:55,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:55,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:47:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:47:55,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:55,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890263090] [2025-03-17 14:47:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890263090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:55,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:47:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882606113] [2025-03-17 14:47:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:47:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:55,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:47:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:47:55,610 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:55,693 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2025-03-17 14:47:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:47:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:47:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:55,695 INFO L225 Difference]: With dead ends: 52 [2025-03-17 14:47:55,695 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 14:47:55,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:47:55,697 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:55,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 14:47:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-03-17 14:47:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-03-17 14:47:55,707 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 7 [2025-03-17 14:47:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:55,707 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-03-17 14:47:55,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-03-17 14:47:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:47:55,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:55,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:47:55,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1640299130, now seen corresponding path program 1 times [2025-03-17 14:47:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146509823] [2025-03-17 14:47:55,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:55,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:47:55,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:47:55,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146509823] [2025-03-17 14:47:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146509823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:47:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633994442] [2025-03-17 14:47:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:55,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:47:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:55,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:47:55,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:55,740 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:55,792 INFO L93 Difference]: Finished difference Result 91 states and 132 transitions. [2025-03-17 14:47:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:47:55,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 14:47:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:55,793 INFO L225 Difference]: With dead ends: 91 [2025-03-17 14:47:55,793 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 14:47:55,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:55,794 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:55,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 14:47:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2025-03-17 14:47:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 82 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2025-03-17 14:47:55,802 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 8 [2025-03-17 14:47:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:55,802 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2025-03-17 14:47:55,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2025-03-17 14:47:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:47:55,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:55,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:47:55,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1640299835, now seen corresponding path program 1 times [2025-03-17 14:47:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719976474] [2025-03-17 14:47:55,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:55,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:47:55,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:47:55,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:55,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:55,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719976474] [2025-03-17 14:47:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719976474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:55,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:47:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845641192] [2025-03-17 14:47:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:55,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:47:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:55,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:47:55,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:55,848 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:55,891 INFO L93 Difference]: Finished difference Result 88 states and 122 transitions. [2025-03-17 14:47:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:47:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 14:47:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:55,892 INFO L225 Difference]: With dead ends: 88 [2025-03-17 14:47:55,892 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 14:47:55,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:55,893 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:55,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 14:47:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2025-03-17 14:47:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 84 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2025-03-17 14:47:55,900 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 8 [2025-03-17 14:47:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:55,900 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2025-03-17 14:47:55,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2025-03-17 14:47:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:47:55,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:55,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:47:55,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash -690334545, now seen corresponding path program 1 times [2025-03-17 14:47:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604670438] [2025-03-17 14:47:55,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:55,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:47:55,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:47:55,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:55,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:55,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604670438] [2025-03-17 14:47:55,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604670438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:55,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:55,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:47:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238390582] [2025-03-17 14:47:55,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:55,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:47:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:55,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:47:55,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:55,959 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-17 14:47:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:55,989 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2025-03-17 14:47:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:47:55,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-17 14:47:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:55,990 INFO L225 Difference]: With dead ends: 85 [2025-03-17 14:47:55,990 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 14:47:55,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:47:55,991 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:55,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 14:47:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 14:47:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 83 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 114 transitions. [2025-03-17 14:47:55,998 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 114 transitions. Word has length 9 [2025-03-17 14:47:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:55,998 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 114 transitions. [2025-03-17 14:47:55,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-17 14:47:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 114 transitions. [2025-03-17 14:47:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:47:55,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:55,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:55,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:47:55,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:55,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash 74465560, now seen corresponding path program 1 times [2025-03-17 14:47:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596735131] [2025-03-17 14:47:55,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:56,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:47:56,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:47:56,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:56,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:56,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:56,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596735131] [2025-03-17 14:47:56,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596735131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:56,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:47:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464231469] [2025-03-17 14:47:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:56,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:56,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:56,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:56,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:56,024 INFO L87 Difference]: Start difference. First operand 84 states and 114 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-17 14:47:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:56,036 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2025-03-17 14:47:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:56,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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) Word has length 10 [2025-03-17 14:47:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:56,037 INFO L225 Difference]: With dead ends: 84 [2025-03-17 14:47:56,037 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 14:47:56,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:56,038 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:56,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 14:47:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-17 14:47:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 82 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-03-17 14:47:56,049 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 10 [2025-03-17 14:47:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-17 14:47:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-17 14:47:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2025-03-17 14:47:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:47:56,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:56,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:56,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:47:56,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 920512982, now seen corresponding path program 1 times [2025-03-17 14:47:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80429422] [2025-03-17 14:47:56,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:56,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:47:56,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:47:56,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:56,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:47:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80429422] [2025-03-17 14:47:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80429422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:47:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414247128] [2025-03-17 14:47:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:56,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:47:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:56,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:47:56,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:56,104 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-17 14:47:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:56,143 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2025-03-17 14:47:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:47:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) Word has length 13 [2025-03-17 14:47:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:56,144 INFO L225 Difference]: With dead ends: 97 [2025-03-17 14:47:56,144 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 14:47:56,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:47:56,145 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:56,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 14:47:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-03-17 14:47:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 82 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-03-17 14:47:56,152 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 13 [2025-03-17 14:47:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:56,152 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-03-17 14:47:56,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-17 14:47:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-03-17 14:47:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:47:56,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:56,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:47:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:47:56,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 920513005, now seen corresponding path program 1 times [2025-03-17 14:47:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:56,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710290745] [2025-03-17 14:47:56,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:56,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:47:56,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:47:56,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:56,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710290745] [2025-03-17 14:47:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710290745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072709173] [2025-03-17 14:47:56,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:56,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:56,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:56,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:56,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:47:56,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:47:56,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:47:56,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:56,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:56,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:47:56,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:56,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072709173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:56,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 14:47:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226888343] [2025-03-17 14:47:56,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:56,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:47:56,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:56,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:47:56,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:47:56,394 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:56,687 INFO L93 Difference]: Finished difference Result 204 states and 280 transitions. [2025-03-17 14:47:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 14:47:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:47:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:56,697 INFO L225 Difference]: With dead ends: 204 [2025-03-17 14:47:56,697 INFO L226 Difference]: Without dead ends: 202 [2025-03-17 14:47:56,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:47:56,698 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 125 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:56,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 22 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-17 14:47:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 109. [2025-03-17 14:47:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2025-03-17 14:47:56,715 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 136 transitions. Word has length 13 [2025-03-17 14:47:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:56,715 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 136 transitions. [2025-03-17 14:47:56,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2025-03-17 14:47:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:47:56,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:56,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:47:56,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:47:56,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:47:56,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1528867946, now seen corresponding path program 1 times [2025-03-17 14:47:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607435751] [2025-03-17 14:47:56,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:56,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:47:56,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:47:56,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:56,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607435751] [2025-03-17 14:47:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607435751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243492522] [2025-03-17 14:47:56,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:56,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:56,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:47:57,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:47:57,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:47:57,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:57,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:47:57,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:57,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:57,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243492522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:57,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:57,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 14:47:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709902660] [2025-03-17 14:47:57,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:57,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:47:57,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:57,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:47:57,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:47:57,139 INFO L87 Difference]: Start difference. First operand 109 states and 136 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:57,337 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2025-03-17 14:47:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:47:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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 14 [2025-03-17 14:47:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:57,338 INFO L225 Difference]: With dead ends: 222 [2025-03-17 14:47:57,338 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 14:47:57,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:47:57,339 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:57,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 29 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 14:47:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 169. [2025-03-17 14:47:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 168 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2025-03-17 14:47:57,357 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 14 [2025-03-17 14:47:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:57,357 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2025-03-17 14:47:57,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2025-03-17 14:47:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:47:57,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:57,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:57,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:47:57,558 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,SelfDestructingSolverStorable10 [2025-03-17 14:47:57,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:57,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash -489044134, now seen corresponding path program 1 times [2025-03-17 14:47:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:57,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947502738] [2025-03-17 14:47:57,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:57,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:57,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:47:57,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:47:57,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:57,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947502738] [2025-03-17 14:47:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947502738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517272788] [2025-03-17 14:47:57,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:57,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:57,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:57,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:57,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:47:57,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:47:57,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:47:57,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:57,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:57,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:47:57,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:57,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:57,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517272788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:57,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:57,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 14:47:57,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037756080] [2025-03-17 14:47:57,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:57,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:47:57,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:57,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:47:57,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:47:57,677 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:57,753 INFO L93 Difference]: Finished difference Result 371 states and 472 transitions. [2025-03-17 14:47:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:47:57,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 18 [2025-03-17 14:47:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:57,755 INFO L225 Difference]: With dead ends: 371 [2025-03-17 14:47:57,755 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 14:47:57,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:47:57,755 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:57,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 14:47:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 276. [2025-03-17 14:47:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 273 states have (on average 1.2380952380952381) internal successors, (338), 275 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 338 transitions. [2025-03-17 14:47:57,777 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 338 transitions. Word has length 18 [2025-03-17 14:47:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:57,777 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 338 transitions. [2025-03-17 14:47:57,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 338 transitions. [2025-03-17 14:47:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 14:47:57,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:57,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:47:57,783 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-17 14:47:57,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:57,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash 141403360, now seen corresponding path program 1 times [2025-03-17 14:47:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926769000] [2025-03-17 14:47:57,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:57,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:47:57,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:47:57,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:57,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:47:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926769000] [2025-03-17 14:47:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926769000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158329462] [2025-03-17 14:47:58,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:58,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:58,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:58,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:58,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:47:58,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:47:58,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:47:58,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:58,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:58,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:47:58,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:47:58,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:47:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158329462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:58,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:58,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-03-17 14:47:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146981040] [2025-03-17 14:47:58,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:58,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 14:47:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:58,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 14:47:58,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:47:58,285 INFO L87 Difference]: Start difference. First operand 276 states and 338 transitions. Second operand has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:58,692 INFO L93 Difference]: Finished difference Result 508 states and 638 transitions. [2025-03-17 14:47:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 14:47:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 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 24 [2025-03-17 14:47:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:58,694 INFO L225 Difference]: With dead ends: 508 [2025-03-17 14:47:58,694 INFO L226 Difference]: Without dead ends: 506 [2025-03-17 14:47:58,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=498, Invalid=1142, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 14:47:58,696 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:58,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-17 14:47:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 310. [2025-03-17 14:47:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 307 states have (on average 1.218241042345277) internal successors, (374), 309 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2025-03-17 14:47:58,719 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 24 [2025-03-17 14:47:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:58,719 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2025-03-17 14:47:58,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2025-03-17 14:47:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:47:58,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:58,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:47:58,728 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-17 14:47:58,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:58,921 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:47:58,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1362161073, now seen corresponding path program 2 times [2025-03-17 14:47:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481626624] [2025-03-17 14:47:58,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:47:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:58,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:47:58,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:47:58,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:47:58,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481626624] [2025-03-17 14:47:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481626624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22725042] [2025-03-17 14:47:59,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:47:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:59,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:59,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:47:59,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:47:59,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:47:59,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:47:59,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:59,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:47:59,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:59,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22725042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:59,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:59,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-03-17 14:47:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240093482] [2025-03-17 14:47:59,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:59,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 14:47:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:59,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 14:47:59,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:47:59,301 INFO L87 Difference]: Start difference. First operand 310 states and 374 transitions. Second operand has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:00,425 INFO L93 Difference]: Finished difference Result 1496 states and 1790 transitions. [2025-03-17 14:48:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-17 14:48:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 22 states have internal predecessors, (85), 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 29 [2025-03-17 14:48:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:00,429 INFO L225 Difference]: With dead ends: 1496 [2025-03-17 14:48:00,429 INFO L226 Difference]: Without dead ends: 1495 [2025-03-17 14:48:00,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2863 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1920, Invalid=5390, Unknown=0, NotChecked=0, Total=7310 [2025-03-17 14:48:00,432 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 251 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 18 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:48:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2025-03-17 14:48:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 706. [2025-03-17 14:48:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 703 states have (on average 1.2147937411095306) internal successors, (854), 705 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 854 transitions. [2025-03-17 14:48:00,486 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 854 transitions. Word has length 29 [2025-03-17 14:48:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:00,486 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 854 transitions. [2025-03-17 14:48:00,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 854 transitions. [2025-03-17 14:48:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 14:48:00,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:00,488 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-03-17 14:48:00,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:48:00,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:48:00,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -736725721, now seen corresponding path program 2 times [2025-03-17 14:48:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378643310] [2025-03-17 14:48:00,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:48:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:00,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:48:00,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:48:00,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:48:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:00,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378643310] [2025-03-17 14:48:00,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378643310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875594988] [2025-03-17 14:48:00,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:48:00,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:00,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:00,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:48:00,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:48:00,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:48:00,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:48:00,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:00,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:48:00,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:01,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875594988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:01,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-17 14:48:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737757979] [2025-03-17 14:48:01,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 14:48:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:01,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 14:48:01,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2025-03-17 14:48:01,203 INFO L87 Difference]: Start difference. First operand 706 states and 854 transitions. Second operand has 32 states, 31 states have (on average 3.032258064516129) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:02,163 INFO L93 Difference]: Finished difference Result 1333 states and 1581 transitions. [2025-03-17 14:48:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-17 14:48:02,163 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.032258064516129) internal successors, (94), 32 states have internal predecessors, (94), 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 32 [2025-03-17 14:48:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:02,166 INFO L225 Difference]: With dead ends: 1333 [2025-03-17 14:48:02,166 INFO L226 Difference]: Without dead ends: 1332 [2025-03-17 14:48:02,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1263, Invalid=2643, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 14:48:02,168 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 453 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:02,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 94 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:48:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-03-17 14:48:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 883. [2025-03-17 14:48:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 880 states have (on average 1.209090909090909) internal successors, (1064), 882 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1064 transitions. [2025-03-17 14:48:02,243 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1064 transitions. Word has length 32 [2025-03-17 14:48:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:02,243 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1064 transitions. [2025-03-17 14:48:02,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.032258064516129) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1064 transitions. [2025-03-17 14:48:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 14:48:02,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:02,244 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1] [2025-03-17 14:48:02,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:48:02,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:48:02,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:02,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash 676185605, now seen corresponding path program 1 times [2025-03-17 14:48:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529721400] [2025-03-17 14:48:02,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:48:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:02,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:48:02,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:48:02,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:48:02,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 14:48:02,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:02,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529721400] [2025-03-17 14:48:02,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529721400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:02,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593572743] [2025-03-17 14:48:02,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:48:02,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:02,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:02,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:02,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:48:02,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:48:02,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:48:02,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:48:02,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:02,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:48:02,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:02,585 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-17 14:48:02,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:02,668 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-17 14:48:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593572743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:02,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:02,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2025-03-17 14:48:02,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279764809] [2025-03-17 14:48:02,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:02,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:48:02,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:02,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:48:02,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:48:02,669 INFO L87 Difference]: Start difference. First operand 883 states and 1064 transitions. Second operand has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:03,135 INFO L93 Difference]: Finished difference Result 3033 states and 3716 transitions. [2025-03-17 14:48:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 14:48:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 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 34 [2025-03-17 14:48:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:03,143 INFO L225 Difference]: With dead ends: 3033 [2025-03-17 14:48:03,143 INFO L226 Difference]: Without dead ends: 2829 [2025-03-17 14:48:03,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 14:48:03,147 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 165 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:03,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 25 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:48:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2025-03-17 14:48:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 457. [2025-03-17 14:48:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 455 states have (on average 1.1868131868131868) internal successors, (540), 456 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 540 transitions. [2025-03-17 14:48:03,219 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 540 transitions. Word has length 34 [2025-03-17 14:48:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:03,219 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 540 transitions. [2025-03-17 14:48:03,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 540 transitions. [2025-03-17 14:48:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 14:48:03,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:03,221 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-17 14:48:03,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:48:03,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:03,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:03,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1173776102, now seen corresponding path program 2 times [2025-03-17 14:48:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:03,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932707103] [2025-03-17 14:48:03,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:48:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:03,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:48:03,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:48:03,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:48:03,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:03,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:03,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932707103] [2025-03-17 14:48:03,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932707103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:03,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756991865] [2025-03-17 14:48:03,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:48:03,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:03,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:03,486 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:03,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:48:03,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:48:03,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:48:03,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:48:03,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:03,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:48:03,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:03,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:03,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756991865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:03,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:03,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 14:48:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164021564] [2025-03-17 14:48:03,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:03,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:48:03,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:03,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:48:03,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:48:03,633 INFO L87 Difference]: Start difference. First operand 457 states and 540 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:03,962 INFO L93 Difference]: Finished difference Result 1682 states and 2063 transitions. [2025-03-17 14:48:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:48:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 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 38 [2025-03-17 14:48:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:03,967 INFO L225 Difference]: With dead ends: 1682 [2025-03-17 14:48:03,967 INFO L226 Difference]: Without dead ends: 1681 [2025-03-17 14:48:03,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:48:03,968 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 144 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:03,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 79 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:48:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-03-17 14:48:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1155. [2025-03-17 14:48:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1153 states have (on average 1.178664353859497) internal successors, (1359), 1154 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1359 transitions. [2025-03-17 14:48:04,120 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1359 transitions. Word has length 38 [2025-03-17 14:48:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:04,120 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1359 transitions. [2025-03-17 14:48:04,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1359 transitions. [2025-03-17 14:48:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 14:48:04,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:04,121 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-17 14:48:04,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:48:04,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:48:04,322 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 216578732, now seen corresponding path program 3 times [2025-03-17 14:48:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:04,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149459018] [2025-03-17 14:48:04,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:04,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-17 14:48:04,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:48:04,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 14:48:04,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:04,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149459018] [2025-03-17 14:48:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149459018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923200725] [2025-03-17 14:48:04,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:04,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:04,477 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:04,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:48:04,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-17 14:48:04,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:48:04,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 14:48:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:04,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:48:04,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:04,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923200725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:04,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:04,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-17 14:48:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392116840] [2025-03-17 14:48:04,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:04,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 14:48:04,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:04,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 14:48:04,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 14:48:04,863 INFO L87 Difference]: Start difference. First operand 1155 states and 1359 transitions. Second operand has 34 states, 33 states have (on average 4.03030303030303) internal successors, (133), 34 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:06,588 INFO L93 Difference]: Finished difference Result 2733 states and 3181 transitions. [2025-03-17 14:48:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-17 14:48:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.03030303030303) internal successors, (133), 34 states have internal predecessors, (133), 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 45 [2025-03-17 14:48:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:06,595 INFO L225 Difference]: With dead ends: 2733 [2025-03-17 14:48:06,595 INFO L226 Difference]: Without dead ends: 2732 [2025-03-17 14:48:06,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5597 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3580, Invalid=9992, Unknown=0, NotChecked=0, Total=13572 [2025-03-17 14:48:06,599 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 566 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:06,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 78 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:48:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-03-17 14:48:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1569. [2025-03-17 14:48:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1567 states have (on average 1.1786853860880664) internal successors, (1847), 1568 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1847 transitions. [2025-03-17 14:48:06,876 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1847 transitions. Word has length 45 [2025-03-17 14:48:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:06,876 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 1847 transitions. [2025-03-17 14:48:06,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.03030303030303) internal successors, (133), 34 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1847 transitions. [2025-03-17 14:48:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 14:48:06,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:06,878 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-17 14:48:06,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:48:07,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:48:07,079 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:07,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -819834730, now seen corresponding path program 4 times [2025-03-17 14:48:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251842441] [2025-03-17 14:48:07,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:48:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:07,083 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-17 14:48:07,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:48:07,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:48:07,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 7 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:07,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251842441] [2025-03-17 14:48:07,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251842441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352576277] [2025-03-17 14:48:07,327 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:48:07,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:07,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:07,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:07,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:48:07,349 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-17 14:48:07,363 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:48:07,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:48:07,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:07,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:48:07,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 95 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 14:48:07,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 95 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 14:48:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352576277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:07,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-03-17 14:48:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701964320] [2025-03-17 14:48:07,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:07,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 14:48:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:07,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 14:48:07,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 14:48:07,733 INFO L87 Difference]: Start difference. First operand 1569 states and 1847 transitions. Second operand has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:09,945 INFO L93 Difference]: Finished difference Result 3191 states and 3764 transitions. [2025-03-17 14:48:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-17 14:48:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-17 14:48:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:09,947 INFO L225 Difference]: With dead ends: 3191 [2025-03-17 14:48:09,947 INFO L226 Difference]: Without dead ends: 458 [2025-03-17 14:48:09,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2156 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1976, Invalid=8124, Unknown=0, NotChecked=0, Total=10100 [2025-03-17 14:48:09,951 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:09,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 50 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 14:48:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-17 14:48:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 142. [2025-03-17 14:48:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 140 states have (on average 1.1214285714285714) internal successors, (157), 141 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-17 14:48:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2025-03-17 14:48:09,989 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 58 [2025-03-17 14:48:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:09,989 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2025-03-17 14:48:09,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2025-03-17 14:48:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 14:48:09,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:09,990 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-17 14:48:09,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:48:10,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:10,191 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:10,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1634625656, now seen corresponding path program 5 times [2025-03-17 14:48:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870986196] [2025-03-17 14:48:10,191 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:48:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:10,194 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-03-17 14:48:10,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 14:48:10,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 14:48:10,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:10,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:10,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870986196] [2025-03-17 14:48:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870986196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087473495] [2025-03-17 14:48:10,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:48:10,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:10,397 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:48:10,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-03-17 14:48:10,427 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 14:48:10,427 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 14:48:10,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:10,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:48:10,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:10,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087473495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:11,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:11,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 52 [2025-03-17 14:48:11,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129244972] [2025-03-17 14:48:11,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:11,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-17 14:48:11,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:11,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-17 14:48:11,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=2207, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 14:48:11,148 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 53 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 53 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:13,605 INFO L93 Difference]: Finished difference Result 462 states and 493 transitions. [2025-03-17 14:48:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-03-17 14:48:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 53 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-17 14:48:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:13,607 INFO L225 Difference]: With dead ends: 462 [2025-03-17 14:48:13,607 INFO L226 Difference]: Without dead ends: 461 [2025-03-17 14:48:13,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7738 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5513, Invalid=15079, Unknown=0, NotChecked=0, Total=20592 [2025-03-17 14:48:13,610 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 727 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:13,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 67 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 14:48:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-17 14:48:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 192. [2025-03-17 14:48:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.1) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2025-03-17 14:48:13,705 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 59 [2025-03-17 14:48:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:13,705 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2025-03-17 14:48:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 53 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2025-03-17 14:48:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 14:48:13,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:13,706 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 1, 1, 1] [2025-03-17 14:48:13,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:48:13,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:13,907 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1973330073, now seen corresponding path program 6 times [2025-03-17 14:48:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114365823] [2025-03-17 14:48:13,907 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:48:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:13,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 11 equivalence classes. [2025-03-17 14:48:13,917 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 14:48:13,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-17 14:48:13,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:14,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114365823] [2025-03-17 14:48:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114365823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207023632] [2025-03-17 14:48:14,116 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:48:14,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:14,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:14,118 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:14,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:48:14,135 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 11 equivalence classes. [2025-03-17 14:48:14,147 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 14:48:14,147 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-17 14:48:14,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:14,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:48:14,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:14,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207023632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:14,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 15] total 49 [2025-03-17 14:48:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058435566] [2025-03-17 14:48:14,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:14,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 14:48:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 14:48:14,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 14:48:14,712 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 50 states, 49 states have (on average 3.693877551020408) internal successors, (181), 50 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:16,536 INFO L93 Difference]: Finished difference Result 422 states and 448 transitions. [2025-03-17 14:48:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-17 14:48:16,537 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.693877551020408) internal successors, (181), 50 states have internal predecessors, (181), 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 61 [2025-03-17 14:48:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:16,538 INFO L225 Difference]: With dead ends: 422 [2025-03-17 14:48:16,538 INFO L226 Difference]: Without dead ends: 421 [2025-03-17 14:48:16,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4689, Invalid=12603, Unknown=0, NotChecked=0, Total=17292 [2025-03-17 14:48:16,540 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 728 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:16,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 57 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:48:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-17 14:48:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 182. [2025-03-17 14:48:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.1166666666666667) internal successors, (201), 181 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2025-03-17 14:48:16,630 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 61 [2025-03-17 14:48:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:16,630 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2025-03-17 14:48:16,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.693877551020408) internal successors, (181), 50 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2025-03-17 14:48:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 14:48:16,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:16,631 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-03-17 14:48:16,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:48:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 14:48:16,832 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 780798946, now seen corresponding path program 7 times [2025-03-17 14:48:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997041807] [2025-03-17 14:48:16,833 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:48:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:16,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 14:48:16,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 14:48:16,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:48:16,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997041807] [2025-03-17 14:48:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997041807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493241163] [2025-03-17 14:48:17,155 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:48:17,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:17,157 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:17,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:48:17,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 14:48:17,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 14:48:17,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:48:17,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:17,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:48:17,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:17,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:17,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493241163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:17,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:17,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 19] total 64 [2025-03-17 14:48:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572667752] [2025-03-17 14:48:17,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:17,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-17 14:48:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:17,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-17 14:48:17,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=3289, Unknown=0, NotChecked=0, Total=4160 [2025-03-17 14:48:17,947 INFO L87 Difference]: Start difference. First operand 182 states and 201 transitions. Second operand has 65 states, 64 states have (on average 3.578125) internal successors, (229), 65 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:21,517 INFO L93 Difference]: Finished difference Result 606 states and 646 transitions. [2025-03-17 14:48:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2025-03-17 14:48:21,520 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 3.578125) internal successors, (229), 65 states have internal predecessors, (229), 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 77 [2025-03-17 14:48:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:21,521 INFO L225 Difference]: With dead ends: 606 [2025-03-17 14:48:21,521 INFO L226 Difference]: Without dead ends: 605 [2025-03-17 14:48:21,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15092 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=9942, Invalid=27888, Unknown=0, NotChecked=0, Total=37830 [2025-03-17 14:48:21,527 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 1302 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:21,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 60 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 14:48:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-17 14:48:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 208. [2025-03-17 14:48:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 1.145631067961165) internal successors, (236), 207 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2025-03-17 14:48:21,624 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 77 [2025-03-17 14:48:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:21,624 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2025-03-17 14:48:21,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.578125) internal successors, (229), 65 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2025-03-17 14:48:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 14:48:21,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:21,625 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2025-03-17 14:48:21,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 14:48:21,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 14:48:21,826 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1850350746, now seen corresponding path program 3 times [2025-03-17 14:48:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035733065] [2025-03-17 14:48:21,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:21,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 15 equivalence classes. [2025-03-17 14:48:21,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:48:21,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 14:48:21,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035733065] [2025-03-17 14:48:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035733065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093223871] [2025-03-17 14:48:22,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:22,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:22,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:22,016 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:22,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:48:22,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 15 equivalence classes. [2025-03-17 14:48:22,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:48:22,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 14:48:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:22,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:48:22,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:22,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093223871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:22,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-03-17 14:48:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52911317] [2025-03-17 14:48:22,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 14:48:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:22,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 14:48:22,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-17 14:48:22,392 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand has 32 states, 31 states have (on average 5.0) internal successors, (155), 32 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:23,239 INFO L93 Difference]: Finished difference Result 910 states and 982 transitions. [2025-03-17 14:48:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 14:48:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.0) internal successors, (155), 32 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-17 14:48:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:23,242 INFO L225 Difference]: With dead ends: 910 [2025-03-17 14:48:23,242 INFO L226 Difference]: Without dead ends: 909 [2025-03-17 14:48:23,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-17 14:48:23,242 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 386 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:23,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 159 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:48:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-17 14:48:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 260. [2025-03-17 14:48:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 258 states have (on average 1.1356589147286822) internal successors, (293), 259 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 293 transitions. [2025-03-17 14:48:23,337 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 293 transitions. Word has length 78 [2025-03-17 14:48:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:23,338 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 293 transitions. [2025-03-17 14:48:23,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.0) internal successors, (155), 32 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 293 transitions. [2025-03-17 14:48:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 14:48:23,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:23,338 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 1, 1, 1] [2025-03-17 14:48:23,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:48:23,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:23,539 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:23,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1754206069, now seen corresponding path program 3 times [2025-03-17 14:48:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:23,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604942768] [2025-03-17 14:48:23,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:23,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 15 equivalence classes. [2025-03-17 14:48:23,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 14:48:23,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 14:48:23,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:24,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:24,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604942768] [2025-03-17 14:48:24,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604942768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:24,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150618307] [2025-03-17 14:48:24,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:24,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:24,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:24,010 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:24,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:48:24,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 15 equivalence classes. [2025-03-17 14:48:24,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 14:48:24,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-17 14:48:24,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:24,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:48:24,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:24,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150618307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:25,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2025-03-17 14:48:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369333919] [2025-03-17 14:48:25,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:25,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-03-17 14:48:25,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:25,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-03-17 14:48:25,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1637, Invalid=6735, Unknown=0, NotChecked=0, Total=8372 [2025-03-17 14:48:25,784 INFO L87 Difference]: Start difference. First operand 260 states and 293 transitions. Second operand has 92 states, 91 states have (on average 3.010989010989011) internal successors, (274), 92 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:31,297 INFO L93 Difference]: Finished difference Result 651 states and 699 transitions. [2025-03-17 14:48:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-03-17 14:48:31,297 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 91 states have (on average 3.010989010989011) internal successors, (274), 92 states have internal predecessors, (274), 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 92 [2025-03-17 14:48:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:31,299 INFO L225 Difference]: With dead ends: 651 [2025-03-17 14:48:31,299 INFO L226 Difference]: Without dead ends: 650 [2025-03-17 14:48:31,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10594 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8689, Invalid=21761, Unknown=0, NotChecked=0, Total=30450 [2025-03-17 14:48:31,300 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 610 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 3248 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 3248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:31,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 184 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 3248 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 14:48:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-17 14:48:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 356. [2025-03-17 14:48:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 354 states have (on average 1.0988700564971752) internal successors, (389), 355 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 389 transitions. [2025-03-17 14:48:31,547 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 389 transitions. Word has length 92 [2025-03-17 14:48:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:31,547 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 389 transitions. [2025-03-17 14:48:31,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 91 states have (on average 3.010989010989011) internal successors, (274), 92 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 389 transitions. [2025-03-17 14:48:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 14:48:31,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:31,548 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 5, 1, 1, 1] [2025-03-17 14:48:31,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:48:31,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:31,748 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:31,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash -634523619, now seen corresponding path program 8 times [2025-03-17 14:48:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247318228] [2025-03-17 14:48:31,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:48:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:31,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-17 14:48:31,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 14:48:31,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:48:31,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:32,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247318228] [2025-03-17 14:48:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247318228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379420341] [2025-03-17 14:48:32,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:48:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:32,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:32,126 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:32,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:48:32,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-17 14:48:32,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 14:48:32,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:48:32,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:32,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:48:32,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:32,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:33,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379420341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:33,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23, 23] total 78 [2025-03-17 14:48:33,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16005621] [2025-03-17 14:48:33,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:33,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-03-17 14:48:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:33,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-03-17 14:48:33,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=4902, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 14:48:33,205 INFO L87 Difference]: Start difference. First operand 356 states and 389 transitions. Second operand has 79 states, 78 states have (on average 3.551282051282051) internal successors, (277), 79 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:39,680 INFO L93 Difference]: Finished difference Result 1042 states and 1089 transitions. [2025-03-17 14:48:39,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-03-17 14:48:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.551282051282051) internal successors, (277), 79 states have internal predecessors, (277), 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 93 [2025-03-17 14:48:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:39,683 INFO L225 Difference]: With dead ends: 1042 [2025-03-17 14:48:39,683 INFO L226 Difference]: Without dead ends: 1041 [2025-03-17 14:48:39,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27602 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=17295, Invalid=50045, Unknown=0, NotChecked=0, Total=67340 [2025-03-17 14:48:39,685 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2063 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 580 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:39,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 73 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [580 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:48:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-03-17 14:48:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 362. [2025-03-17 14:48:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 360 states have (on average 1.1) internal successors, (396), 361 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 396 transitions. [2025-03-17 14:48:40,000 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 396 transitions. Word has length 93 [2025-03-17 14:48:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:40,000 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 396 transitions. [2025-03-17 14:48:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.551282051282051) internal successors, (277), 79 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 396 transitions. [2025-03-17 14:48:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 14:48:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:40,001 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 5, 5, 5, 5, 5, 1, 1, 1] [2025-03-17 14:48:40,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 14:48:40,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 14:48:40,201 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:40,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -574605446, now seen corresponding path program 9 times [2025-03-17 14:48:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:40,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565973229] [2025-03-17 14:48:40,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:40,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 13 equivalence classes. [2025-03-17 14:48:40,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 14:48:40,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-17 14:48:40,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:40,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565973229] [2025-03-17 14:48:40,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565973229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893582890] [2025-03-17 14:48:40,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:40,730 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:40,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 14:48:40,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 13 equivalence classes. [2025-03-17 14:48:40,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 14:48:40,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-17 14:48:40,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:40,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 14:48:40,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:41,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893582890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:42,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31, 31] total 96 [2025-03-17 14:48:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297840382] [2025-03-17 14:48:42,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-17 14:48:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:42,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-17 14:48:42,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=7630, Unknown=0, NotChecked=0, Total=9312 [2025-03-17 14:48:42,566 INFO L87 Difference]: Start difference. First operand 362 states and 396 transitions. Second operand has 97 states, 96 states have (on average 3.2604166666666665) internal successors, (313), 97 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:54,095 INFO L93 Difference]: Finished difference Result 1308 states and 1368 transitions. [2025-03-17 14:48:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 272 states. [2025-03-17 14:48:54,096 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 96 states have (on average 3.2604166666666665) internal successors, (313), 97 states have internal predecessors, (313), 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 105 [2025-03-17 14:48:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:54,098 INFO L225 Difference]: With dead ends: 1308 [2025-03-17 14:48:54,098 INFO L226 Difference]: Without dead ends: 1307 [2025-03-17 14:48:54,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50797 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=31958, Invalid=86034, Unknown=0, NotChecked=0, Total=117992 [2025-03-17 14:48:54,102 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2544 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2544 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:54,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2544 Valid, 120 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 14:48:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-03-17 14:48:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 362. [2025-03-17 14:48:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 360 states have (on average 1.1) internal successors, (396), 361 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 396 transitions. [2025-03-17 14:48:54,454 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 396 transitions. Word has length 105 [2025-03-17 14:48:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:54,454 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 396 transitions. [2025-03-17 14:48:54,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 96 states have (on average 3.2604166666666665) internal successors, (313), 97 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:48:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 396 transitions. [2025-03-17 14:48:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 14:48:54,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:54,455 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-17 14:48:54,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 14:48:54,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 14:48:54,656 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:48:54,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1795933160, now seen corresponding path program 10 times [2025-03-17 14:48:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-03-17 14:48:54,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:48:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:54,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 109 statements into 2 equivalence classes. [2025-03-17 14:48:54,676 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 14:48:54,676 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:48:54,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 607 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:55,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-03-17 14:48:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61501919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846718225] [2025-03-17 14:48:55,157 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:48:55,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:55,159 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:55,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 14:48:55,175 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 109 statements into 2 equivalence classes. [2025-03-17 14:48:55,188 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 14:48:55,188 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:48:55,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:55,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 14:48:55,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 607 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:55,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 607 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846718225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:56,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:56,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2025-03-17 14:48:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181147247] [2025-03-17 14:48:56,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2025-03-17 14:48:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:56,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2025-03-17 14:48:56,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2779, Invalid=11263, Unknown=0, NotChecked=0, Total=14042 [2025-03-17 14:48:56,983 INFO L87 Difference]: Start difference. First operand 362 states and 396 transitions. Second operand has 119 states, 118 states have (on average 2.7542372881355934) internal successors, (325), 119 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)