./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-ext-properties/test-0504_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext-properties/test-0504_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:52:03,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:52:03,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:52:03,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:52:03,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:52:03,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:52:03,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:52:03,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:52:03,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:52:03,368 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:52:03,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:52:03,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:52:03,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:52:03,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:52:03,369 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:52:03,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:52:03,370 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:52:03,371 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:52:03,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:52:03,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:52:03,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:52:03,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:52:03,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:52:03,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:52:03,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:52:03,372 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2025-03-09 01:52:03,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:52:03,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:52:03,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:52:03,596 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:52:03,596 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:52:03,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2025-03-09 01:52:04,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9995f27d3/b6f1632365d347dca181c2e464d906ac/FLAG6034f0e4c [2025-03-09 01:52:05,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:52:05,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2025-03-09 01:52:05,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9995f27d3/b6f1632365d347dca181c2e464d906ac/FLAG6034f0e4c [2025-03-09 01:52:05,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9995f27d3/b6f1632365d347dca181c2e464d906ac [2025-03-09 01:52:05,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:52:05,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:52:05,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:52:05,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:52:05,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:52:05,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288d7102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05, skipping insertion in model container [2025-03-09 01:52:05,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:52:05,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:52:05,508 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:52:05,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:52:05,556 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:52:05,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05 WrapperNode [2025-03-09 01:52:05,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:52:05,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:52:05,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:52:05,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:52:05,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,581 INFO L138 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2025-03-09 01:52:05,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:52:05,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:52:05,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:52:05,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:52:05,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,603 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-03-09 01:52:05,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:52:05,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:52:05,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:52:05,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:52:05,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (1/1) ... [2025-03-09 01:52:05,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:52:05,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:05,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:52:05,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:52:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:52:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:52:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:52:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:52:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:52:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:52:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:52:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:52:05,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:52:05,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:52:05,932 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-09 01:52:05,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:52:05,941 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:52:05,941 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:52:05,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:52:05 BoogieIcfgContainer [2025-03-09 01:52:05,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:52:05,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:52:05,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:52:05,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:52:05,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:52:05" (1/3) ... [2025-03-09 01:52:05,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be57359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:52:05, skipping insertion in model container [2025-03-09 01:52:05,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:05" (2/3) ... [2025-03-09 01:52:05,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be57359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:52:05, skipping insertion in model container [2025-03-09 01:52:05,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:52:05" (3/3) ... [2025-03-09 01:52:05,950 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2025-03-09 01:52:05,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:52:05,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0504_1.i that has 1 procedures, 42 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-09 01:52:05,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:52:06,001 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;@15b55952, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:52:06,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:52:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:52:06,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:06,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:52:06,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash 82037109, now seen corresponding path program 1 times [2025-03-09 01:52:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267720200] [2025-03-09 01:52:06,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:06,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:52:06,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:52:06,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:06,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267720200] [2025-03-09 01:52:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267720200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:06,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:06,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:52:06,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781424892] [2025-03-09 01:52:06,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:06,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:52:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:06,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:52:06,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:52:06,118 INFO L87 Difference]: Start difference. First operand has 42 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 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 2 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-09 01:52:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:06,126 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2025-03-09 01:52:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:52:06,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 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-09 01:52:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:06,131 INFO L225 Difference]: With dead ends: 82 [2025-03-09 01:52:06,131 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 01:52:06,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:52:06,134 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:06,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 01:52:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-09 01:52:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-03-09 01:52:06,153 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 5 [2025-03-09 01:52:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:06,153 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-09 01:52:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-09 01:52:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-03-09 01:52:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:52:06,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:06,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:52:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:52:06,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:06,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1751807974, now seen corresponding path program 1 times [2025-03-09 01:52:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927887678] [2025-03-09 01:52:06,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:06,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:52:06,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:52:06,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:06,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:06,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927887678] [2025-03-09 01:52:06,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927887678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:06,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:06,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:52:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708024331] [2025-03-09 01:52:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:06,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:06,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:06,233 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:06,270 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-03-09 01:52:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:52:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:06,271 INFO L225 Difference]: With dead ends: 55 [2025-03-09 01:52:06,271 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 01:52:06,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:06,272 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:06,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 01:52:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 01:52:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-09 01:52:06,278 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 6 [2025-03-09 01:52:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:06,278 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-09 01:52:06,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-09 01:52:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:52:06,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:06,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:06,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:52:06,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:06,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:06,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1124467255, now seen corresponding path program 1 times [2025-03-09 01:52:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:06,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522487128] [2025-03-09 01:52:06,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:06,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:52:06,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:52:06,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:06,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522487128] [2025-03-09 01:52:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522487128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:06,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:06,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:52:06,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592010620] [2025-03-09 01:52:06,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:06,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:52:06,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:06,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:52:06,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:06,415 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:06,485 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2025-03-09 01:52:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:52:06,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-09 01:52:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:06,485 INFO L225 Difference]: With dead ends: 67 [2025-03-09 01:52:06,486 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 01:52:06,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:06,486 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:06,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 131 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 01:52:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2025-03-09 01:52:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-09 01:52:06,489 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 10 [2025-03-09 01:52:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:06,490 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-09 01:52:06,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-09 01:52:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:52:06,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:06,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:06,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:52:06,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:06,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash 498746543, now seen corresponding path program 1 times [2025-03-09 01:52:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:06,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608112340] [2025-03-09 01:52:06,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:06,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:52:06,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:52:06,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:06,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608112340] [2025-03-09 01:52:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608112340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:06,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:06,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:52:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036018302] [2025-03-09 01:52:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:06,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:52:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:06,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:52:06,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:06,573 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:06,630 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2025-03-09 01:52:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:52:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:52:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:06,631 INFO L225 Difference]: With dead ends: 67 [2025-03-09 01:52:06,631 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 01:52:06,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:06,631 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:06,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 129 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 01:52:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2025-03-09 01:52:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-09 01:52:06,636 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 11 [2025-03-09 01:52:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:06,636 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-09 01:52:06,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-09 01:52:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:52:06,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:06,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:06,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:52:06,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2023501384, now seen corresponding path program 1 times [2025-03-09 01:52:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602191811] [2025-03-09 01:52:06,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:06,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:52:06,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:52:06,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:06,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602191811] [2025-03-09 01:52:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602191811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:52:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889521936] [2025-03-09 01:52:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:06,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:06,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:06,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:06,714 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:06,749 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-03-09 01:52:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-09 01:52:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:06,750 INFO L225 Difference]: With dead ends: 56 [2025-03-09 01:52:06,750 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 01:52:06,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:06,750 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:06,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 89 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 01:52:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-03-09 01:52:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-09 01:52:06,755 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 15 [2025-03-09 01:52:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:06,755 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-09 01:52:06,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-09 01:52:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:52:06,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:06,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:52:06,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1456010405, now seen corresponding path program 1 times [2025-03-09 01:52:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255956896] [2025-03-09 01:52:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:06,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:52:06,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:52:06,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:06,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:52:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774732068] [2025-03-09 01:52:06,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:06,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:06,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:06,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:52:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:52:06,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:52:06,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:06,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:06,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:52:06,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:07,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:52:07,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255956896] [2025-03-09 01:52:07,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:52:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774732068] [2025-03-09 01:52:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774732068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:07,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:07,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:52:07,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570330414] [2025-03-09 01:52:07,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:07,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:52:07,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:07,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:52:07,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:52:07,013 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:07,097 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-03-09 01:52:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:52:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-09 01:52:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:07,098 INFO L225 Difference]: With dead ends: 55 [2025-03-09 01:52:07,098 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:52:07,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:52:07,099 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:07,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:52:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-09 01:52:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.372093023255814) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-09 01:52:07,105 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 19 [2025-03-09 01:52:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:07,105 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-09 01:52:07,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-09 01:52:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 01:52:07,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:07,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:07,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:52:07,306 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,SelfDestructingSolverStorable5 [2025-03-09 01:52:07,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:07,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:07,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2108317714, now seen corresponding path program 1 times [2025-03-09 01:52:07,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:07,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968572680] [2025-03-09 01:52:07,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:07,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:07,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:52:07,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:52:07,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:07,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:52:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456205612] [2025-03-09 01:52:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:07,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:07,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:07,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:52:07,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:52:07,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:52:07,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:07,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:07,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:52:07,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:07,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:52:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:07,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968572680] [2025-03-09 01:52:07,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:52:07,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456205612] [2025-03-09 01:52:07,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456205612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:07,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:52:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31067228] [2025-03-09 01:52:07,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:52:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:07,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:52:07,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:52:07,482 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:07,545 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2025-03-09 01:52:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:52:07,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-09 01:52:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:07,546 INFO L225 Difference]: With dead ends: 73 [2025-03-09 01:52:07,546 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 01:52:07,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:52:07,548 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:07,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 01:52:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2025-03-09 01:52:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 57 states have (on average 1.368421052631579) internal successors, (78), 62 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-09 01:52:07,557 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 20 [2025-03-09 01:52:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:07,557 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-09 01:52:07,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-09 01:52:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:52:07,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:07,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:07,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:52:07,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 01:52:07,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:07,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2145364011, now seen corresponding path program 1 times [2025-03-09 01:52:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:07,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52258658] [2025-03-09 01:52:07,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:07,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:52:07,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:52:07,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:07,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:52:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52258658] [2025-03-09 01:52:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52258658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:07,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:07,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:52:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879789572] [2025-03-09 01:52:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:07,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:52:07,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:07,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:52:07,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:52:07,805 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:07,811 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2025-03-09 01:52:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:52:07,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 22 [2025-03-09 01:52:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:07,813 INFO L225 Difference]: With dead ends: 63 [2025-03-09 01:52:07,813 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 01:52:07,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:52:07,814 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:07,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 01:52:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-09 01:52:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 61 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2025-03-09 01:52:07,818 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 22 [2025-03-09 01:52:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:07,818 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2025-03-09 01:52:07,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2025-03-09 01:52:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:52:07,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:07,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:07,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:52:07,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2145361994, now seen corresponding path program 1 times [2025-03-09 01:52:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416797953] [2025-03-09 01:52:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:07,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:52:07,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:52:07,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:07,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416797953] [2025-03-09 01:52:07,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416797953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:07,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:07,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:52:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726343753] [2025-03-09 01:52:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:07,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:07,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:07,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:07,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:07,875 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-09 01:52:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:07,894 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2025-03-09 01:52:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:07,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) Word has length 22 [2025-03-09 01:52:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:07,895 INFO L225 Difference]: With dead ends: 63 [2025-03-09 01:52:07,895 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 01:52:07,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:07,895 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:07,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 01:52:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-09 01:52:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 60 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-09 01:52:07,900 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 22 [2025-03-09 01:52:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:07,900 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-09 01:52:07,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-09 01:52:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-09 01:52:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:52:07,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:07,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:07,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:52:07,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:07,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2081774923, now seen corresponding path program 1 times [2025-03-09 01:52:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:07,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053325150] [2025-03-09 01:52:07,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:07,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:52:07,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:52:07,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:07,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053325150] [2025-03-09 01:52:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053325150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:52:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253642322] [2025-03-09 01:52:07,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:07,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:07,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:07,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:07,952 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-09 01:52:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:07,970 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-03-09 01:52:07,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:07,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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) Word has length 23 [2025-03-09 01:52:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:07,971 INFO L225 Difference]: With dead ends: 61 [2025-03-09 01:52:07,971 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 01:52:07,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:07,972 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:07,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 01:52:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-09 01:52:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-03-09 01:52:07,978 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 23 [2025-03-09 01:52:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:07,978 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-03-09 01:52:07,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-09 01:52:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-03-09 01:52:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:52:07,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:07,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:07,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:52:07,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:07,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1817153837, now seen corresponding path program 1 times [2025-03-09 01:52:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513575894] [2025-03-09 01:52:07,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:07,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:52:08,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:52:08,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:08,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:52:08,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:08,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513575894] [2025-03-09 01:52:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513575894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:08,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:52:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29524096] [2025-03-09 01:52:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:52:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:08,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:52:08,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:08,059 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-09 01:52:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:08,091 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-03-09 01:52:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:52:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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) Word has length 25 [2025-03-09 01:52:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:08,092 INFO L225 Difference]: With dead ends: 57 [2025-03-09 01:52:08,092 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 01:52:08,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:08,092 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:08,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 01:52:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2025-03-09 01:52:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-09 01:52:08,097 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 25 [2025-03-09 01:52:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:08,097 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-09 01:52:08,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-09 01:52:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-03-09 01:52:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:52:08,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:08,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:08,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:52:08,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:08,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1260179534, now seen corresponding path program 1 times [2025-03-09 01:52:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471138320] [2025-03-09 01:52:08,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:08,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:52:08,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:52:08,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:08,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471138320] [2025-03-09 01:52:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471138320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:08,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207946379] [2025-03-09 01:52:08,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:08,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:08,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:52:08,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:52:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:52:08,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:08,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:08,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:52:08,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:08,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:52:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207946379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:52:08,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:52:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:52:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352168966] [2025-03-09 01:52:08,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:52:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:52:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:08,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:52:08,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:52:08,389 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:08,462 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2025-03-09 01:52:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:52:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-09 01:52:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:08,462 INFO L225 Difference]: With dead ends: 98 [2025-03-09 01:52:08,462 INFO L226 Difference]: Without dead ends: 97 [2025-03-09 01:52:08,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:52:08,463 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:08,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 164 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-09 01:52:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-09 01:52:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 96 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2025-03-09 01:52:08,476 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 26 [2025-03-09 01:52:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:08,476 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2025-03-09 01:52:08,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2025-03-09 01:52:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:52:08,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:08,476 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:08,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:52:08,677 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-09 01:52:08,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:52:08,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1075746741, now seen corresponding path program 1 times [2025-03-09 01:52:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101475188] [2025-03-09 01:52:08,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:08,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:08,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:52:08,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:52:08,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:08,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:52:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930825342] [2025-03-09 01:52:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:08,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:08,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:52:08,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:52:08,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:52:08,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:08,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:08,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:52:08,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:08,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:52:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101475188] [2025-03-09 01:52:17,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:52:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930825342] [2025-03-09 01:52:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930825342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:52:17,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:52:17,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-09 01:52:17,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506919545] [2025-03-09 01:52:17,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:52:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:52:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:17,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:52:17,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=240, Unknown=2, NotChecked=0, Total=306 [2025-03-09 01:52:17,275 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand has 18 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:30,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-09 01:53:34,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-09 01:53:38,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-09 01:53:42,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-09 01:53:46,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-09 01:53:50,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]