./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:01:58,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:01:58,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:01:58,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:01:58,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:01:58,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:01:58,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:01:58,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:01:58,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:01:58,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:01:58,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:01:58,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:01:58,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:01:58,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:01:58,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:01:58,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:01:58,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:01:58,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:01:58,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:01:58,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:01:58,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:01:58,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:01:58,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:01:58,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:01:58,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:01:58,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:01:58,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:01:58,152 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 ! call(reach_error())) ) 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 -> 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 [2025-03-17 00:01:58,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:01:58,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:01:58,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:01:58,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:01:58,388 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:01:58,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-03-17 00:01:59,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec46b2f5f/b75e1e3cc7974aa19886f0bc5f51ef48/FLAGb9076cb0a [2025-03-17 00:01:59,776 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:01:59,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-03-17 00:01:59,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec46b2f5f/b75e1e3cc7974aa19886f0bc5f51ef48/FLAGb9076cb0a [2025-03-17 00:02:00,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec46b2f5f/b75e1e3cc7974aa19886f0bc5f51ef48 [2025-03-17 00:02:00,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:02:00,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:02:00,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:00,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:02:00,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:02:00,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00, skipping insertion in model container [2025-03-17 00:02:00,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:02:00,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-03-17 00:02:00,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:00,312 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:02:00,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-03-17 00:02:00,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:00,404 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:02:00,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00 WrapperNode [2025-03-17 00:02:00,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:00,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:00,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:02:00,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:02:00,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,463 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-03-17 00:02:00,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:00,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:02:00,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:02:00,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:02:00,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,510 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:02:00,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:02:00,551 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:02:00,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:02:00,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:02:00,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (1/1) ... [2025-03-17 00:02:00,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:00,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:00,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:02:00,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:02:00,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:02:00,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:02:00,697 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:02:00,698 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:02:01,411 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 00:02:01,412 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:02:01,436 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:02:01,436 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:02:01,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:01 BoogieIcfgContainer [2025-03-17 00:02:01,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:02:01,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:02:01,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:02:01,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:02:01,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:02:00" (1/3) ... [2025-03-17 00:02:01,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1263ed5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:01, skipping insertion in model container [2025-03-17 00:02:01,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:00" (2/3) ... [2025-03-17 00:02:01,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1263ed5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:01, skipping insertion in model container [2025-03-17 00:02:01,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:01" (3/3) ... [2025-03-17 00:02:01,445 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-03-17 00:02:01,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:02:01,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i that has 2 procedures, 197 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:02:01,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:02:01,510 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;@7386a28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:02:01,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:02:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 122 states have (on average 1.540983606557377) internal successors, (188), 123 states have internal predecessors, (188), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 00:02:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:01,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:01,534 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:01,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:01,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -261169919, now seen corresponding path program 1 times [2025-03-17 00:02:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929390504] [2025-03-17 00:02:01,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:01,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:01,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:01,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-17 00:02:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:01,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929390504] [2025-03-17 00:02:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929390504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137774300] [2025-03-17 00:02:01,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:01,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:01,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:01,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:01,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:02:02,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:02,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:02,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:02,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:02,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:02:02,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-17 00:02:02,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:02:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137774300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:02:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:02:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608890750] [2025-03-17 00:02:02,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:02,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:02:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:02,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:02:02,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:02:02,379 INFO L87 Difference]: Start difference. First operand has 197 states, 122 states have (on average 1.540983606557377) internal successors, (188), 123 states have internal predecessors, (188), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-17 00:02:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:02,416 INFO L93 Difference]: Finished difference Result 391 states and 734 transitions. [2025-03-17 00:02:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:02:02,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 453 [2025-03-17 00:02:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:02,424 INFO L225 Difference]: With dead ends: 391 [2025-03-17 00:02:02,424 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 00:02:02,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 454 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-17 00:02:02,429 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:02,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 00:02:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-17 00:02:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 121 states have (on average 1.5206611570247934) internal successors, (184), 121 states have internal predecessors, (184), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 00:02:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 328 transitions. [2025-03-17 00:02:02,480 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 328 transitions. Word has length 453 [2025-03-17 00:02:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:02,480 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 328 transitions. [2025-03-17 00:02:02,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-17 00:02:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 328 transitions. [2025-03-17 00:02:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:02,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:02,492 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:02,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:02:02,693 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,SelfDestructingSolverStorable0 [2025-03-17 00:02:02,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:02,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash -725959687, now seen corresponding path program 1 times [2025-03-17 00:02:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:02,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810932968] [2025-03-17 00:02:02,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:02,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:02,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:02,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:02,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:02,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 00:02:03,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:03,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810932968] [2025-03-17 00:02:03,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810932968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:03,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:03,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826989083] [2025-03-17 00:02:03,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:03,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:03,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:03,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:03,156 INFO L87 Difference]: Start difference. First operand 195 states and 328 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:03,221 INFO L93 Difference]: Finished difference Result 548 states and 914 transitions. [2025-03-17 00:02:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 453 [2025-03-17 00:02:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:03,229 INFO L225 Difference]: With dead ends: 548 [2025-03-17 00:02:03,230 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 00:02:03,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:03,232 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 249 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:03,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 833 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 00:02:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 212. [2025-03-17 00:02:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 138 states have (on average 1.5579710144927537) internal successors, (215), 138 states have internal predecessors, (215), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 00:02:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 359 transitions. [2025-03-17 00:02:03,269 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 359 transitions. Word has length 453 [2025-03-17 00:02:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:03,271 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 359 transitions. [2025-03-17 00:02:03,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 359 transitions. [2025-03-17 00:02:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:03,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:03,275 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:03,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:02:03,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:03,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash -375159750, now seen corresponding path program 1 times [2025-03-17 00:02:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:03,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555609842] [2025-03-17 00:02:03,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:03,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:03,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:03,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:03,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 00:02:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555609842] [2025-03-17 00:02:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555609842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:03,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:03,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295102900] [2025-03-17 00:02:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:03,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:03,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:03,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:03,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:03,542 INFO L87 Difference]: Start difference. First operand 212 states and 359 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:03,612 INFO L93 Difference]: Finished difference Result 565 states and 943 transitions. [2025-03-17 00:02:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:03,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 453 [2025-03-17 00:02:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:03,620 INFO L225 Difference]: With dead ends: 565 [2025-03-17 00:02:03,620 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 00:02:03,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:03,622 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 245 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:03,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 662 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 00:02:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 212. [2025-03-17 00:02:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 138 states have internal predecessors, (213), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 00:02:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 357 transitions. [2025-03-17 00:02:03,662 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 357 transitions. Word has length 453 [2025-03-17 00:02:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:03,662 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 357 transitions. [2025-03-17 00:02:03,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 357 transitions. [2025-03-17 00:02:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:03,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:03,667 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:02:03,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:03,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -783983975, now seen corresponding path program 1 times [2025-03-17 00:02:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112104380] [2025-03-17 00:02:03,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:03,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:03,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:03,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:03,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 00:02:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112104380] [2025-03-17 00:02:04,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112104380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:04,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:02:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045888777] [2025-03-17 00:02:04,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:04,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:04,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:04,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:04,234 INFO L87 Difference]: Start difference. First operand 212 states and 357 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:04,639 INFO L93 Difference]: Finished difference Result 635 states and 1070 transitions. [2025-03-17 00:02:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 453 [2025-03-17 00:02:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:04,643 INFO L225 Difference]: With dead ends: 635 [2025-03-17 00:02:04,643 INFO L226 Difference]: Without dead ends: 424 [2025-03-17 00:02:04,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:04,646 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 258 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:04,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1121 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:02:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-17 00:02:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 408. [2025-03-17 00:02:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 261 states have (on average 1.5440613026819923) internal successors, (403), 261 states have internal predecessors, (403), 144 states have call successors, (144), 2 states have call predecessors, (144), 2 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-17 00:02:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 691 transitions. [2025-03-17 00:02:04,721 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 691 transitions. Word has length 453 [2025-03-17 00:02:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:04,721 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 691 transitions. [2025-03-17 00:02:04,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 691 transitions. [2025-03-17 00:02:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:04,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:04,725 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:04,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:02:04,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:04,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash -654901256, now seen corresponding path program 1 times [2025-03-17 00:02:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696575566] [2025-03-17 00:02:04,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:04,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:04,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:04,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:04,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 00:02:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:05,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696575566] [2025-03-17 00:02:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696575566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:05,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496632215] [2025-03-17 00:02:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:05,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:05,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:05,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:05,518 INFO L87 Difference]: Start difference. First operand 408 states and 691 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:05,835 INFO L93 Difference]: Finished difference Result 846 states and 1424 transitions. [2025-03-17 00:02:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:05,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 453 [2025-03-17 00:02:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:05,840 INFO L225 Difference]: With dead ends: 846 [2025-03-17 00:02:05,840 INFO L226 Difference]: Without dead ends: 632 [2025-03-17 00:02:05,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:05,842 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 293 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:05,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 966 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:02:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-17 00:02:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 617. [2025-03-17 00:02:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 216 states have call successors, (216), 3 states have call predecessors, (216), 3 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-17 00:02:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1044 transitions. [2025-03-17 00:02:05,912 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1044 transitions. Word has length 453 [2025-03-17 00:02:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:05,915 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 1044 transitions. [2025-03-17 00:02:05,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1044 transitions. [2025-03-17 00:02:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:05,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:05,923 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:05,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:02:05,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:05,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash 852650553, now seen corresponding path program 1 times [2025-03-17 00:02:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:05,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448447529] [2025-03-17 00:02:05,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:05,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 00:02:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:06,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448447529] [2025-03-17 00:02:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448447529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415291655] [2025-03-17 00:02:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:06,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:06,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:06,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:06,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:06,549 INFO L87 Difference]: Start difference. First operand 617 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:07,040 INFO L93 Difference]: Finished difference Result 1866 states and 3136 transitions. [2025-03-17 00:02:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:07,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 453 [2025-03-17 00:02:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:07,050 INFO L225 Difference]: With dead ends: 1866 [2025-03-17 00:02:07,050 INFO L226 Difference]: Without dead ends: 1421 [2025-03-17 00:02:07,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:07,052 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 633 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:07,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1198 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:02:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-03-17 00:02:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1019. [2025-03-17 00:02:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 768 states have (on average 1.6536458333333333) internal successors, (1270), 770 states have internal predecessors, (1270), 244 states have call successors, (244), 6 states have call predecessors, (244), 6 states have return successors, (244), 242 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 00:02:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1758 transitions. [2025-03-17 00:02:07,196 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1758 transitions. Word has length 453 [2025-03-17 00:02:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:07,197 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1758 transitions. [2025-03-17 00:02:07,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1758 transitions. [2025-03-17 00:02:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:07,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:07,203 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:07,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:02:07,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:07,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1471377286, now seen corresponding path program 1 times [2025-03-17 00:02:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:07,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673921666] [2025-03-17 00:02:07,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:07,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 00:02:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673921666] [2025-03-17 00:02:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673921666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:07,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:07,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:07,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758017407] [2025-03-17 00:02:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:07,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:07,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:07,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:07,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:07,461 INFO L87 Difference]: Start difference. First operand 1019 states and 1758 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:07,614 INFO L93 Difference]: Finished difference Result 2614 states and 4509 transitions. [2025-03-17 00:02:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:07,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 453 [2025-03-17 00:02:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:07,627 INFO L225 Difference]: With dead ends: 2614 [2025-03-17 00:02:07,628 INFO L226 Difference]: Without dead ends: 1770 [2025-03-17 00:02:07,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:07,631 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 204 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:07,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 750 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-17 00:02:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1768. [2025-03-17 00:02:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1341 states have (on average 1.645786726323639) internal successors, (2207), 1345 states have internal predecessors, (2207), 416 states have call successors, (416), 10 states have call predecessors, (416), 10 states have return successors, (416), 412 states have call predecessors, (416), 416 states have call successors, (416) [2025-03-17 00:02:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 3039 transitions. [2025-03-17 00:02:07,774 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 3039 transitions. Word has length 453 [2025-03-17 00:02:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:07,775 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 3039 transitions. [2025-03-17 00:02:07,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 3039 transitions. [2025-03-17 00:02:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:07,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:07,778 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:02:07,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:07,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 844891194, now seen corresponding path program 1 times [2025-03-17 00:02:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:07,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449209302] [2025-03-17 00:02:07,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:07,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:07,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:07,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:07,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 00:02:08,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:08,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449209302] [2025-03-17 00:02:08,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449209302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:08,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:08,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:02:08,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314032517] [2025-03-17 00:02:08,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:08,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:08,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:08,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:08,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:08,397 INFO L87 Difference]: Start difference. First operand 1768 states and 3039 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:09,365 INFO L93 Difference]: Finished difference Result 8767 states and 14965 transitions. [2025-03-17 00:02:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:02:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 453 [2025-03-17 00:02:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:09,408 INFO L225 Difference]: With dead ends: 8767 [2025-03-17 00:02:09,408 INFO L226 Difference]: Without dead ends: 7214 [2025-03-17 00:02:09,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:09,417 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1143 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:09,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1755 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:02:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7214 states. [2025-03-17 00:02:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7214 to 3650. [2025-03-17 00:02:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 2871 states have (on average 1.665621734587252) internal successors, (4782), 2879 states have internal predecessors, (4782), 760 states have call successors, (760), 18 states have call predecessors, (760), 18 states have return successors, (760), 752 states have call predecessors, (760), 760 states have call successors, (760) [2025-03-17 00:02:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 6302 transitions. [2025-03-17 00:02:09,834 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 6302 transitions. Word has length 453 [2025-03-17 00:02:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:09,835 INFO L471 AbstractCegarLoop]: Abstraction has 3650 states and 6302 transitions. [2025-03-17 00:02:09,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 00:02:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 6302 transitions. [2025-03-17 00:02:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:02:09,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:09,839 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:09,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:02:09,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:09,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash 604351065, now seen corresponding path program 1 times [2025-03-17 00:02:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:09,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063219565] [2025-03-17 00:02:09,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:09,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:10,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:10,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:10,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-17 00:02:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063219565] [2025-03-17 00:02:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063219565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580627926] [2025-03-17 00:02:10,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:10,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:10,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:10,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:10,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:02:10,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:02:10,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:02:10,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:10,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:10,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 00:02:10,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 3777 proven. 162 refuted. 0 times theorem prover too weak. 6285 trivial. 0 not checked. [2025-03-17 00:02:11,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-17 00:02:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580627926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:12,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:12,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 11] total 18 [2025-03-17 00:02:12,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250104064] [2025-03-17 00:02:12,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:12,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 00:02:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:12,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 00:02:12,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:02:12,305 INFO L87 Difference]: Start difference. First operand 3650 states and 6302 transitions. Second operand has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2025-03-17 00:02:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:13,974 INFO L93 Difference]: Finished difference Result 6815 states and 11652 transitions. [2025-03-17 00:02:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 00:02:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) Word has length 453 [2025-03-17 00:02:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:13,996 INFO L225 Difference]: With dead ends: 6815 [2025-03-17 00:02:13,996 INFO L226 Difference]: Without dead ends: 3555 [2025-03-17 00:02:14,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 897 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 00:02:14,007 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 1455 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 1135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1135 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:14,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1594 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1135 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:02:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2025-03-17 00:02:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 1244. [2025-03-17 00:02:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 868 states have (on average 1.5610599078341014) internal successors, (1355), 868 states have internal predecessors, (1355), 360 states have call successors, (360), 15 states have call predecessors, (360), 15 states have return successors, (360), 360 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-17 00:02:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 2075 transitions. [2025-03-17 00:02:14,209 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 2075 transitions. Word has length 453 [2025-03-17 00:02:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:14,210 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 2075 transitions. [2025-03-17 00:02:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2025-03-17 00:02:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 2075 transitions. [2025-03-17 00:02:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:02:14,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:14,213 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:14,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:02:14,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 00:02:14,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:14,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2085442434, now seen corresponding path program 1 times [2025-03-17 00:02:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:14,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566467663] [2025-03-17 00:02:14,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:14,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:14,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:02:14,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:02:14,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:14,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 42 proven. 171 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-17 00:02:14,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:14,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566467663] [2025-03-17 00:02:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566467663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:14,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400740607] [2025-03-17 00:02:14,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:14,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:14,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:14,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:14,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:02:15,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:02:15,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:02:15,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:15,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:15,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:02:15,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4061 proven. 156 refuted. 0 times theorem prover too weak. 6007 trivial. 0 not checked. [2025-03-17 00:02:15,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 57 proven. 156 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-17 00:02:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400740607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:15,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:15,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-17 00:02:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969331337] [2025-03-17 00:02:15,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:15,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:02:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:15,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:02:15,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:02:15,999 INFO L87 Difference]: Start difference. First operand 1244 states and 2075 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-03-17 00:02:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:17,422 INFO L93 Difference]: Finished difference Result 3664 states and 5953 transitions. [2025-03-17 00:02:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 00:02:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) Word has length 454 [2025-03-17 00:02:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:17,437 INFO L225 Difference]: With dead ends: 3664 [2025-03-17 00:02:17,437 INFO L226 Difference]: Without dead ends: 2624 [2025-03-17 00:02:17,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 907 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=862, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 00:02:17,442 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1102 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:17,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1315 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:02:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-03-17 00:02:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1391. [2025-03-17 00:02:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1005 states have (on average 1.5641791044776119) internal successors, (1572), 1005 states have internal predecessors, (1572), 360 states have call successors, (360), 25 states have call predecessors, (360), 25 states have return successors, (360), 360 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-17 00:02:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2292 transitions. [2025-03-17 00:02:17,595 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2292 transitions. Word has length 454 [2025-03-17 00:02:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:17,596 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 2292 transitions. [2025-03-17 00:02:17,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-03-17 00:02:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2292 transitions. [2025-03-17 00:02:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:02:17,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:17,600 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:17,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:02:17,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:17,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:17,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash 73240158, now seen corresponding path program 1 times [2025-03-17 00:02:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:17,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916723182] [2025-03-17 00:02:17,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:17,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:02:17,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:02:17,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:17,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 90 proven. 330 refuted. 0 times theorem prover too weak. 9804 trivial. 0 not checked. [2025-03-17 00:02:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:18,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916723182] [2025-03-17 00:02:18,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916723182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:18,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275697786] [2025-03-17 00:02:18,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:18,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:18,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:18,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:18,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:02:18,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:02:18,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:02:18,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:18,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:18,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 00:02:18,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4302 proven. 459 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2025-03-17 00:02:20,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 162 proven. 468 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-03-17 00:02:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275697786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:21,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 24 [2025-03-17 00:02:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045957683] [2025-03-17 00:02:21,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 00:02:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 00:02:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:02:21,276 INFO L87 Difference]: Start difference. First operand 1391 states and 2292 transitions. Second operand has 24 states, 24 states have (on average 8.083333333333334) internal successors, (194), 24 states have internal predecessors, (194), 6 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (185), 6 states have call predecessors, (185), 6 states have call successors, (185) [2025-03-17 00:02:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:24,032 INFO L93 Difference]: Finished difference Result 2353 states and 3756 transitions. [2025-03-17 00:02:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 00:02:24,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.083333333333334) internal successors, (194), 24 states have internal predecessors, (194), 6 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (185), 6 states have call predecessors, (185), 6 states have call successors, (185) Word has length 454 [2025-03-17 00:02:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:24,040 INFO L225 Difference]: With dead ends: 2353 [2025-03-17 00:02:24,040 INFO L226 Difference]: Without dead ends: 1185 [2025-03-17 00:02:24,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 901 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1522, Invalid=4640, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 00:02:24,045 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 1874 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:24,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 2621 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:02:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-17 00:02:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 635. [2025-03-17 00:02:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 397 states have (on average 1.3828715365239295) internal successors, (549), 397 states have internal predecessors, (549), 216 states have call successors, (216), 21 states have call predecessors, (216), 21 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-17 00:02:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 981 transitions. [2025-03-17 00:02:24,125 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 981 transitions. Word has length 454 [2025-03-17 00:02:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:24,126 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 981 transitions. [2025-03-17 00:02:24,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.083333333333334) internal successors, (194), 24 states have internal predecessors, (194), 6 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (185), 6 states have call predecessors, (185), 6 states have call successors, (185) [2025-03-17 00:02:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 981 transitions. [2025-03-17 00:02:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 00:02:24,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:24,128 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:24,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 00:02:24,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:24,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:24,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2083306853, now seen corresponding path program 1 times [2025-03-17 00:02:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390018804] [2025-03-17 00:02:24,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:24,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:02:24,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:02:24,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:24,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 117 proven. 96 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-17 00:02:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390018804] [2025-03-17 00:02:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390018804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288076698] [2025-03-17 00:02:26,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:26,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:26,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:26,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:26,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 00:02:26,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:02:26,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:02:26,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:26,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:26,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 00:02:26,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 6282 proven. 249 refuted. 0 times theorem prover too weak. 3693 trivial. 0 not checked. [2025-03-17 00:02:32,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 372 proven. 258 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-03-17 00:02:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288076698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:36,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2025-03-17 00:02:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377162767] [2025-03-17 00:02:36,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:36,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 00:02:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:36,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 00:02:36,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 00:02:36,703 INFO L87 Difference]: Start difference. First operand 635 states and 981 transitions. Second operand has 36 states, 36 states have (on average 6.138888888888889) internal successors, (221), 35 states have internal predecessors, (221), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) [2025-03-17 00:02:47,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:02:50,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:02:55,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:02:59,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:03:06,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:03:11,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:03:17,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]