./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label14.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:11:22,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:11:22,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:11:22,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:11:22,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:11:22,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:11:22,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:11:22,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:11:22,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:11:22,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:11:22,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:11:22,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:11:22,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:11:22,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:11:22,459 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:11:22,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:11:22,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:11:22,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:11:22,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:11:22,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:11:22,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:11:22,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:11:22,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:11:22,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:11:22,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:11:22,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:11:22,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:11:22,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:11:22,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:11:22,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:11:22,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:11:22,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:11:22,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:11:22,463 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-jdk21/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 -> 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 [2025-01-09 00:11:22,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:11:22,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:11:22,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:11:22,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:11:22,744 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:11:22,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2025-01-09 00:11:24,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46fec732f/285efcfb51d94a5191e8b21ac89bcf7e/FLAG3cd2b50c2 [2025-01-09 00:11:24,667 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:11:24,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2025-01-09 00:11:24,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46fec732f/285efcfb51d94a5191e8b21ac89bcf7e/FLAG3cd2b50c2 [2025-01-09 00:11:24,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46fec732f/285efcfb51d94a5191e8b21ac89bcf7e [2025-01-09 00:11:24,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:11:24,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:11:24,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:11:24,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:11:24,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:11:24,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:11:24" (1/1) ... [2025-01-09 00:11:24,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71642d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:24, skipping insertion in model container [2025-01-09 00:11:24,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:11:24" (1/1) ... [2025-01-09 00:11:24,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:11:25,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c[6990,7003] [2025-01-09 00:11:25,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:11:25,499 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:11:25,549 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c[6990,7003] [2025-01-09 00:11:25,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:11:25,799 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:11:25,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25 WrapperNode [2025-01-09 00:11:25,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:11:25,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:11:25,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:11:25,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:11:25,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:25,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,087 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:11:26,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:11:26,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:11:26,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:11:26,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:11:26,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,305 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-01-09 00:11:26,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:11:26,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:11:26,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:11:26,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:11:26,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (1/1) ... [2025-01-09 00:11:26,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:11:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:11:26,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:11:26,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:11:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:11:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:11:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:11:26,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:11:26,691 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:11:26,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:11:30,279 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:11:30,279 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:11:30,309 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:11:30,309 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:11:30,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:11:30 BoogieIcfgContainer [2025-01-09 00:11:30,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:11:30,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:11:30,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:11:30,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:11:30,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:11:24" (1/3) ... [2025-01-09 00:11:30,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764598bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:11:30, skipping insertion in model container [2025-01-09 00:11:30,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:25" (2/3) ... [2025-01-09 00:11:30,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764598bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:11:30, skipping insertion in model container [2025-01-09 00:11:30,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:11:30" (3/3) ... [2025-01-09 00:11:30,319 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label14.c [2025-01-09 00:11:30,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:11:30,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label14.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:11:30,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:11:30,415 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;@428d283b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:11:30,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:11:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 00:11:30,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:30,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:11:30,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:30,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2062713132, now seen corresponding path program 1 times [2025-01-09 00:11:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672520283] [2025-01-09 00:11:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:30,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 00:11:30,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 00:11:30,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:30,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:30,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672520283] [2025-01-09 00:11:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672520283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:30,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:30,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29467568] [2025-01-09 00:11:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:30,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:30,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:30,784 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:33,328 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-01-09 00:11:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 00:11:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:33,343 INFO L225 Difference]: With dead ends: 1667 [2025-01-09 00:11:33,343 INFO L226 Difference]: Without dead ends: 998 [2025-01-09 00:11:33,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:33,354 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 498 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:33,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 277 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:11:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-01-09 00:11:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-01-09 00:11:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-01-09 00:11:33,444 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 47 [2025-01-09 00:11:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:33,444 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-01-09 00:11:33,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-01-09 00:11:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 00:11:33,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:33,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-01-09 00:11:33,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:11:33,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:33,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1230106731, now seen corresponding path program 1 times [2025-01-09 00:11:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564040826] [2025-01-09 00:11:33,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:33,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 00:11:33,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 00:11:33,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:33,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564040826] [2025-01-09 00:11:33,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564040826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044953505] [2025-01-09 00:11:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:33,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:33,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:33,829 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:36,137 INFO L93 Difference]: Finished difference Result 2842 states and 4883 transitions. [2025-01-09 00:11:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:36,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 00:11:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:36,146 INFO L225 Difference]: With dead ends: 2842 [2025-01-09 00:11:36,146 INFO L226 Difference]: Without dead ends: 1862 [2025-01-09 00:11:36,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:36,149 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 407 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:36,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 504 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:11:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-01-09 00:11:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1854. [2025-01-09 00:11:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.489476524554776) internal successors, (2760), 1853 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2760 transitions. [2025-01-09 00:11:36,218 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2760 transitions. Word has length 112 [2025-01-09 00:11:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:36,219 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2760 transitions. [2025-01-09 00:11:36,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2760 transitions. [2025-01-09 00:11:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 00:11:36,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:36,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:11:36,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:11:36,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:36,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -865947666, now seen corresponding path program 1 times [2025-01-09 00:11:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096860498] [2025-01-09 00:11:36,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:36,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 00:11:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 00:11:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096860498] [2025-01-09 00:11:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096860498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:36,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203323010] [2025-01-09 00:11:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:36,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:36,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:36,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:36,611 INFO L87 Difference]: Start difference. First operand 1854 states and 2760 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:38,837 INFO L93 Difference]: Finished difference Result 4995 states and 7383 transitions. [2025-01-09 00:11:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:38,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-01-09 00:11:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:38,850 INFO L225 Difference]: With dead ends: 4995 [2025-01-09 00:11:38,850 INFO L226 Difference]: Without dead ends: 3143 [2025-01-09 00:11:38,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:38,854 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 368 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:38,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 558 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:11:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-01-09 00:11:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3141. [2025-01-09 00:11:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.320063694267516) internal successors, (4145), 3140 states have internal predecessors, (4145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4145 transitions. [2025-01-09 00:11:38,911 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4145 transitions. Word has length 122 [2025-01-09 00:11:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:38,912 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4145 transitions. [2025-01-09 00:11:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4145 transitions. [2025-01-09 00:11:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 00:11:38,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:38,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:11:38,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:11:38,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:38,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1828521856, now seen corresponding path program 1 times [2025-01-09 00:11:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674190307] [2025-01-09 00:11:38,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:38,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 00:11:38,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 00:11:38,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:38,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674190307] [2025-01-09 00:11:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674190307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432018938] [2025-01-09 00:11:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:39,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:39,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:39,223 INFO L87 Difference]: Start difference. First operand 3141 states and 4145 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:40,931 INFO L93 Difference]: Finished difference Result 5855 states and 7845 transitions. [2025-01-09 00:11:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-01-09 00:11:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:40,943 INFO L225 Difference]: With dead ends: 5855 [2025-01-09 00:11:40,944 INFO L226 Difference]: Without dead ends: 3141 [2025-01-09 00:11:40,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:40,949 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 322 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:40,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 567 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:11:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2025-01-09 00:11:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 3141. [2025-01-09 00:11:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.3181528662420383) internal successors, (4139), 3140 states have internal predecessors, (4139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4139 transitions. [2025-01-09 00:11:41,011 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4139 transitions. Word has length 152 [2025-01-09 00:11:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:41,013 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4139 transitions. [2025-01-09 00:11:41,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4139 transitions. [2025-01-09 00:11:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 00:11:41,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:41,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:11:41,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:11:41,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:41,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2413329, now seen corresponding path program 1 times [2025-01-09 00:11:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:41,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429863949] [2025-01-09 00:11:41,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:41,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 00:11:41,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 00:11:41,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:41,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429863949] [2025-01-09 00:11:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429863949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:41,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:41,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533149066] [2025-01-09 00:11:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:41,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:41,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:41,181 INFO L87 Difference]: Start difference. First operand 3141 states and 4139 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:42,935 INFO L93 Difference]: Finished difference Result 8416 states and 11320 transitions. [2025-01-09 00:11:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-01-09 00:11:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:42,951 INFO L225 Difference]: With dead ends: 8416 [2025-01-09 00:11:42,951 INFO L226 Difference]: Without dead ends: 5702 [2025-01-09 00:11:42,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:42,956 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:42,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:11:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2025-01-09 00:11:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 3995. [2025-01-09 00:11:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3994 states have (on average 1.2511266900350526) internal successors, (4997), 3994 states have internal predecessors, (4997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 4997 transitions. [2025-01-09 00:11:43,030 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 4997 transitions. Word has length 158 [2025-01-09 00:11:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:43,030 INFO L471 AbstractCegarLoop]: Abstraction has 3995 states and 4997 transitions. [2025-01-09 00:11:43,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 4997 transitions. [2025-01-09 00:11:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 00:11:43,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:43,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-09 00:11:43,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:11:43,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1230621953, now seen corresponding path program 1 times [2025-01-09 00:11:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332048967] [2025-01-09 00:11:43,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:43,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 00:11:43,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 00:11:43,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:43,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332048967] [2025-01-09 00:11:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332048967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:43,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188976366] [2025-01-09 00:11:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:43,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:43,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:43,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:43,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:43,220 INFO L87 Difference]: Start difference. First operand 3995 states and 4997 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:45,102 INFO L93 Difference]: Finished difference Result 10123 states and 13029 transitions. [2025-01-09 00:11:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-01-09 00:11:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:45,116 INFO L225 Difference]: With dead ends: 10123 [2025-01-09 00:11:45,117 INFO L226 Difference]: Without dead ends: 6130 [2025-01-09 00:11:45,122 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-01-09 00:11:45,123 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:45,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 814 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:11:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2025-01-09 00:11:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6130. [2025-01-09 00:11:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6130 states, 6129 states have (on average 1.2437591776798824) internal successors, (7623), 6129 states have internal predecessors, (7623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6130 states to 6130 states and 7623 transitions. [2025-01-09 00:11:45,218 INFO L78 Accepts]: Start accepts. Automaton has 6130 states and 7623 transitions. Word has length 195 [2025-01-09 00:11:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:45,218 INFO L471 AbstractCegarLoop]: Abstraction has 6130 states and 7623 transitions. [2025-01-09 00:11:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6130 states and 7623 transitions. [2025-01-09 00:11:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 00:11:45,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:45,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:45,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:11:45,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1708312242, now seen corresponding path program 1 times [2025-01-09 00:11:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232430957] [2025-01-09 00:11:45,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:45,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 00:11:45,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 00:11:45,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:45,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:11:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232430957] [2025-01-09 00:11:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232430957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:45,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:45,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:45,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195574185] [2025-01-09 00:11:45,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:45,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:45,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:45,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:45,543 INFO L87 Difference]: Start difference. First operand 6130 states and 7623 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:47,393 INFO L93 Difference]: Finished difference Result 15656 states and 19748 transitions. [2025-01-09 00:11:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-01-09 00:11:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:47,419 INFO L225 Difference]: With dead ends: 15656 [2025-01-09 00:11:47,419 INFO L226 Difference]: Without dead ends: 9528 [2025-01-09 00:11:47,425 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-01-09 00:11:47,425 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 401 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:47,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 545 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:11:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9528 states. [2025-01-09 00:11:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9528 to 8674. [2025-01-09 00:11:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8674 states, 8673 states have (on average 1.2024674276490257) internal successors, (10429), 8673 states have internal predecessors, (10429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 10429 transitions. [2025-01-09 00:11:47,553 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 10429 transitions. Word has length 201 [2025-01-09 00:11:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:47,554 INFO L471 AbstractCegarLoop]: Abstraction has 8674 states and 10429 transitions. [2025-01-09 00:11:47,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 10429 transitions. [2025-01-09 00:11:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 00:11:47,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:47,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:47,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:11:47,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:47,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash 826431135, now seen corresponding path program 1 times [2025-01-09 00:11:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:47,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472057697] [2025-01-09 00:11:47,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:47,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 00:11:47,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 00:11:47,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:47,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:11:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:47,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472057697] [2025-01-09 00:11:47,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472057697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:47,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:47,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:47,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476535736] [2025-01-09 00:11:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:47,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:47,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:47,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:47,683 INFO L87 Difference]: Start difference. First operand 8674 states and 10429 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:49,718 INFO L93 Difference]: Finished difference Result 21607 states and 26252 transitions. [2025-01-09 00:11:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-01-09 00:11:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:49,741 INFO L225 Difference]: With dead ends: 21607 [2025-01-09 00:11:49,742 INFO L226 Difference]: Without dead ends: 11628 [2025-01-09 00:11:49,752 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-01-09 00:11:49,753 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 546 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:49,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 637 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:11:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11628 states. [2025-01-09 00:11:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11628 to 9920. [2025-01-09 00:11:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9920 states, 9919 states have (on average 1.1524347212420607) internal successors, (11431), 9919 states have internal predecessors, (11431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9920 states to 9920 states and 11431 transitions. [2025-01-09 00:11:49,939 INFO L78 Accepts]: Start accepts. Automaton has 9920 states and 11431 transitions. Word has length 214 [2025-01-09 00:11:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:49,939 INFO L471 AbstractCegarLoop]: Abstraction has 9920 states and 11431 transitions. [2025-01-09 00:11:49,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9920 states and 11431 transitions. [2025-01-09 00:11:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 00:11:49,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:49,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:11:49,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:11:49,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:49,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash 316792936, now seen corresponding path program 1 times [2025-01-09 00:11:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568663217] [2025-01-09 00:11:49,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:49,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 00:11:50,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 00:11:50,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:50,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:11:50,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:50,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568663217] [2025-01-09 00:11:50,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568663217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:50,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700352514] [2025-01-09 00:11:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:50,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:50,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:50,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:50,266 INFO L87 Difference]: Start difference. First operand 9920 states and 11431 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:51,815 INFO L93 Difference]: Finished difference Result 24959 states and 29029 transitions. [2025-01-09 00:11:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-01-09 00:11:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:51,840 INFO L225 Difference]: With dead ends: 24959 [2025-01-09 00:11:51,841 INFO L226 Difference]: Without dead ends: 15041 [2025-01-09 00:11:51,897 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-01-09 00:11:51,901 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 442 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:51,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 327 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:11:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15041 states. [2025-01-09 00:11:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15041 to 14181. [2025-01-09 00:11:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14181 states, 14180 states have (on average 1.1610719322990126) internal successors, (16464), 14180 states have internal predecessors, (16464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14181 states to 14181 states and 16464 transitions. [2025-01-09 00:11:52,055 INFO L78 Accepts]: Start accepts. Automaton has 14181 states and 16464 transitions. Word has length 267 [2025-01-09 00:11:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:52,055 INFO L471 AbstractCegarLoop]: Abstraction has 14181 states and 16464 transitions. [2025-01-09 00:11:52,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 14181 states and 16464 transitions. [2025-01-09 00:11:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 00:11:52,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:52,062 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-01-09 00:11:52,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:11:52,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:52,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash 549860706, now seen corresponding path program 1 times [2025-01-09 00:11:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148852315] [2025-01-09 00:11:52,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:52,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 00:11:52,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 00:11:52,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:52,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:11:52,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:52,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148852315] [2025-01-09 00:11:52,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148852315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:52,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:52,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:11:52,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396705505] [2025-01-09 00:11:52,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:52,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:11:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:52,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:11:52,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:11:52,619 INFO L87 Difference]: Start difference. First operand 14181 states and 16464 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:55,072 INFO L93 Difference]: Finished difference Result 44173 states and 51252 transitions. [2025-01-09 00:11:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:11:55,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-01-09 00:11:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:55,119 INFO L225 Difference]: With dead ends: 44173 [2025-01-09 00:11:55,120 INFO L226 Difference]: Without dead ends: 28715 [2025-01-09 00:11:55,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:11:55,138 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 871 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:55,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 212 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:11:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28715 states. [2025-01-09 00:11:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28715 to 27400. [2025-01-09 00:11:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27400 states, 27399 states have (on average 1.1519033541370123) internal successors, (31561), 27399 states have internal predecessors, (31561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27400 states to 27400 states and 31561 transitions. [2025-01-09 00:11:55,590 INFO L78 Accepts]: Start accepts. Automaton has 27400 states and 31561 transitions. Word has length 307 [2025-01-09 00:11:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 27400 states and 31561 transitions. [2025-01-09 00:11:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 27400 states and 31561 transitions. [2025-01-09 00:11:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-01-09 00:11:55,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:55,605 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:11:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:11:55,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -451047794, now seen corresponding path program 1 times [2025-01-09 00:11:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886049646] [2025-01-09 00:11:55,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:55,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-09 00:11:55,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-09 00:11:55,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:55,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 232 proven. 82 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 00:11:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886049646] [2025-01-09 00:11:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886049646] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:11:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316396832] [2025-01-09 00:11:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:56,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:56,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:11:56,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:11:56,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:11:56,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-09 00:11:56,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-09 00:11:56,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:56,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:56,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:11:56,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:11:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 206 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:56,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:11:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316396832] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:11:57,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:11:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-01-09 00:11:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409483148] [2025-01-09 00:11:57,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:57,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:11:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:57,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:11:57,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:11:57,359 INFO L87 Difference]: Start difference. First operand 27400 states and 31561 transitions. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:00,572 INFO L93 Difference]: Finished difference Result 82900 states and 95344 transitions. [2025-01-09 00:12:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:12:00,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 388 [2025-01-09 00:12:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:00,650 INFO L225 Difference]: With dead ends: 82900 [2025-01-09 00:12:00,650 INFO L226 Difference]: Without dead ends: 54227 [2025-01-09 00:12:00,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:12:00,679 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1181 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:00,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 162 Invalid, 3747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 00:12:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54227 states. [2025-01-09 00:12:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54227 to 54216. [2025-01-09 00:12:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54216 states, 54215 states have (on average 1.1149681822373883) internal successors, (60448), 54215 states have internal predecessors, (60448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54216 states to 54216 states and 60448 transitions. [2025-01-09 00:12:01,605 INFO L78 Accepts]: Start accepts. Automaton has 54216 states and 60448 transitions. Word has length 388 [2025-01-09 00:12:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:01,606 INFO L471 AbstractCegarLoop]: Abstraction has 54216 states and 60448 transitions. [2025-01-09 00:12:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 54216 states and 60448 transitions. [2025-01-09 00:12:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-01-09 00:12:01,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:01,650 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:12:01,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:12:01,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 00:12:01,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1793778390, now seen corresponding path program 1 times [2025-01-09 00:12:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:01,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572342940] [2025-01-09 00:12:01,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:01,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:01,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 00:12:02,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 00:12:02,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:02,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 401 proven. 73 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:12:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572342940] [2025-01-09 00:12:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572342940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134806804] [2025-01-09 00:12:02,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:02,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:02,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:02,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:12:02,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:12:02,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 00:12:02,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 00:12:02,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:02,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:02,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:12:02,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:12:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 401 proven. 73 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:12:03,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:12:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:12:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134806804] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:12:03,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:12:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990865036] [2025-01-09 00:12:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:03,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:03,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:03,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:03,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:12:03,308 INFO L87 Difference]: Start difference. First operand 54216 states and 60448 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:05,798 INFO L93 Difference]: Finished difference Result 125027 states and 139410 transitions. [2025-01-09 00:12:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 489 [2025-01-09 00:12:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:05,872 INFO L225 Difference]: With dead ends: 125027 [2025-01-09 00:12:05,872 INFO L226 Difference]: Without dead ends: 70813 [2025-01-09 00:12:05,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 975 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:12:05,896 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 818 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:05,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 141 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:12:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70813 states. [2025-01-09 00:12:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70813 to 66131. [2025-01-09 00:12:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66131 states, 66130 states have (on average 1.1084832904884319) internal successors, (73304), 66130 states have internal predecessors, (73304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66131 states to 66131 states and 73304 transitions. [2025-01-09 00:12:06,806 INFO L78 Accepts]: Start accepts. Automaton has 66131 states and 73304 transitions. Word has length 489 [2025-01-09 00:12:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:06,806 INFO L471 AbstractCegarLoop]: Abstraction has 66131 states and 73304 transitions. [2025-01-09 00:12:06,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 66131 states and 73304 transitions. [2025-01-09 00:12:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 00:12:06,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:06,822 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:12:06,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:12:07,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:07,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:07,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1749345540, now seen corresponding path program 1 times [2025-01-09 00:12:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:07,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99563898] [2025-01-09 00:12:07,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:07,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 00:12:07,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 00:12:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:12:07,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99563898] [2025-01-09 00:12:07,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99563898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:07,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:07,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:07,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647045567] [2025-01-09 00:12:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:07,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:07,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:07,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:07,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:07,543 INFO L87 Difference]: Start difference. First operand 66131 states and 73304 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:09,462 INFO L93 Difference]: Finished difference Result 148062 states and 164001 transitions. [2025-01-09 00:12:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:09,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 518 [2025-01-09 00:12:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:09,542 INFO L225 Difference]: With dead ends: 148062 [2025-01-09 00:12:09,542 INFO L226 Difference]: Without dead ends: 81933 [2025-01-09 00:12:09,557 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-01-09 00:12:09,558 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 364 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:09,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 752 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:12:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81933 states. [2025-01-09 00:12:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81933 to 81922. [2025-01-09 00:12:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81922 states, 81921 states have (on average 1.0911243759231455) internal successors, (89386), 81921 states have internal predecessors, (89386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81922 states to 81922 states and 89386 transitions. [2025-01-09 00:12:10,532 INFO L78 Accepts]: Start accepts. Automaton has 81922 states and 89386 transitions. Word has length 518 [2025-01-09 00:12:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:10,532 INFO L471 AbstractCegarLoop]: Abstraction has 81922 states and 89386 transitions. [2025-01-09 00:12:10,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 81922 states and 89386 transitions. [2025-01-09 00:12:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 00:12:10,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:10,548 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:12:10,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:12:10,548 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:10,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:10,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1804407167, now seen corresponding path program 1 times [2025-01-09 00:12:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:10,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252680499] [2025-01-09 00:12:10,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:10,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 00:12:10,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 00:12:10,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:10,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 524 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252680499] [2025-01-09 00:12:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252680499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578520626] [2025-01-09 00:12:11,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:11,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:11,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:11,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:12:11,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:12:11,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 00:12:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 00:12:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:11,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:12:11,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:12:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 457 proven. 82 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:12:12,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:12:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 457 proven. 82 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:12:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578520626] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:12:13,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:12:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-01-09 00:12:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858869510] [2025-01-09 00:12:13,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:12:13,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:12:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:13,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:12:13,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:12:13,223 INFO L87 Difference]: Start difference. First operand 81922 states and 89386 transitions. Second operand has 10 states, 10 states have (on average 108.6) internal successors, (1086), 10 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:25,278 INFO L93 Difference]: Finished difference Result 243984 states and 266053 transitions. [2025-01-09 00:12:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 00:12:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 108.6) internal successors, (1086), 10 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 520 [2025-01-09 00:12:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:25,475 INFO L225 Difference]: With dead ends: 243984 [2025-01-09 00:12:25,475 INFO L226 Difference]: Without dead ends: 159513 [2025-01-09 00:12:25,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 1050 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-01-09 00:12:25,527 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 7988 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 12862 mSolverCounterSat, 1956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7988 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 14818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1956 IncrementalHoareTripleChecker+Valid, 12862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:25,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7988 Valid, 423 Invalid, 14818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1956 Valid, 12862 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2025-01-09 00:12:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159513 states. [2025-01-09 00:12:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159513 to 111268. [2025-01-09 00:12:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111268 states, 111267 states have (on average 1.0788733407029938) internal successors, (120043), 111267 states have internal predecessors, (120043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111268 states to 111268 states and 120043 transitions. [2025-01-09 00:12:27,297 INFO L78 Accepts]: Start accepts. Automaton has 111268 states and 120043 transitions. Word has length 520 [2025-01-09 00:12:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:27,297 INFO L471 AbstractCegarLoop]: Abstraction has 111268 states and 120043 transitions. [2025-01-09 00:12:27,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.6) internal successors, (1086), 10 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 111268 states and 120043 transitions. [2025-01-09 00:12:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-01-09 00:12:27,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:27,308 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:12:27,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:12:27,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:27,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:27,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1590211356, now seen corresponding path program 1 times [2025-01-09 00:12:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:27,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294890383] [2025-01-09 00:12:27,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:27,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-01-09 00:12:27,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-01-09 00:12:27,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:27,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 00:12:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:27,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294890383] [2025-01-09 00:12:27,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294890383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:27,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:27,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821832380] [2025-01-09 00:12:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:27,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:27,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:27,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:27,885 INFO L87 Difference]: Start difference. First operand 111268 states and 120043 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:29,596 INFO L93 Difference]: Finished difference Result 236142 states and 255084 transitions. [2025-01-09 00:12:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 561 [2025-01-09 00:12:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:29,746 INFO L225 Difference]: With dead ends: 236142 [2025-01-09 00:12:29,746 INFO L226 Difference]: Without dead ends: 124876 [2025-01-09 00:12:29,823 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-01-09 00:12:29,825 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 481 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:29,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 673 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:12:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124876 states. [2025-01-09 00:12:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124876 to 123593. [2025-01-09 00:12:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123593 states, 123592 states have (on average 1.073168166224351) internal successors, (132635), 123592 states have internal predecessors, (132635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123593 states to 123593 states and 132635 transitions. [2025-01-09 00:12:31,392 INFO L78 Accepts]: Start accepts. Automaton has 123593 states and 132635 transitions. Word has length 561 [2025-01-09 00:12:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:31,393 INFO L471 AbstractCegarLoop]: Abstraction has 123593 states and 132635 transitions. [2025-01-09 00:12:31,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 123593 states and 132635 transitions. [2025-01-09 00:12:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-01-09 00:12:31,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:31,415 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:12:31,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:12:31,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:31,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1320046822, now seen corresponding path program 1 times [2025-01-09 00:12:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:31,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881095211] [2025-01-09 00:12:31,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:31,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-01-09 00:12:31,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-01-09 00:12:31,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:31,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 00:12:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:32,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881095211] [2025-01-09 00:12:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881095211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:32,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663271489] [2025-01-09 00:12:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:32,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:32,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:32,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:32,092 INFO L87 Difference]: Start difference. First operand 123593 states and 132635 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:33,912 INFO L93 Difference]: Finished difference Result 261660 states and 281296 transitions. [2025-01-09 00:12:33,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:33,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 616 [2025-01-09 00:12:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:34,092 INFO L225 Difference]: With dead ends: 261660 [2025-01-09 00:12:34,092 INFO L226 Difference]: Without dead ends: 138069 [2025-01-09 00:12:34,173 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-01-09 00:12:34,174 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 275 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:34,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 238 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:12:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138069 states. [2025-01-09 00:12:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138069 to 135502. [2025-01-09 00:12:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135502 states, 135501 states have (on average 1.0673721965151548) internal successors, (144630), 135501 states have internal predecessors, (144630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135502 states to 135502 states and 144630 transitions. [2025-01-09 00:12:35,384 INFO L78 Accepts]: Start accepts. Automaton has 135502 states and 144630 transitions. Word has length 616 [2025-01-09 00:12:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:35,385 INFO L471 AbstractCegarLoop]: Abstraction has 135502 states and 144630 transitions. [2025-01-09 00:12:35,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 135502 states and 144630 transitions. [2025-01-09 00:12:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-01-09 00:12:35,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:35,396 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:12:35,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:12:35,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:35,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1284018346, now seen corresponding path program 1 times [2025-01-09 00:12:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465903322] [2025-01-09 00:12:35,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:35,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-01-09 00:12:35,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-01-09 00:12:35,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:35,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 911 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:12:36,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:36,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465903322] [2025-01-09 00:12:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465903322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:36,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:12:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089342179] [2025-01-09 00:12:36,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:36,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:36,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:36,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:12:36,069 INFO L87 Difference]: Start difference. First operand 135502 states and 144630 transitions. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)