./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb4961f065bc31a38b9b03268e48a86b12180156e24896eac19eb1c64de65ea9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:19:20,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:19:20,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:19:20,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:19:20,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:19:20,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:19:20,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:19:20,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:19:20,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:19:20,456 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:19:20,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:19:20,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:19:20,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:19:20,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:19:20,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:19:20,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:19:20,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:19:20,458 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:19:20,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:19:20,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:19:20,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:19:20,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:19:20,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:19:20,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:19:20,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:19:20,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:19:20,461 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb4961f065bc31a38b9b03268e48a86b12180156e24896eac19eb1c64de65ea9 [2025-03-08 02:19:20,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:19:20,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:19:20,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:19:20,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:19:20,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:19:20,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label09.c [2025-03-08 02:19:21,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a50b9487/fe65d8acd63642a0b275c75c3235c65a/FLAG366568f09 [2025-03-08 02:19:22,256 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:19:22,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label09.c [2025-03-08 02:19:22,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a50b9487/fe65d8acd63642a0b275c75c3235c65a/FLAG366568f09 [2025-03-08 02:19:22,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a50b9487/fe65d8acd63642a0b275c75c3235c65a [2025-03-08 02:19:22,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:19:22,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:19:22,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:19:22,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:19:22,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:19:22,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:19:22" (1/1) ... [2025-03-08 02:19:22,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efbafe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:22, skipping insertion in model container [2025-03-08 02:19:22,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:19:22" (1/1) ... [2025-03-08 02:19:22,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:19:22,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label09.c[6533,6546] [2025-03-08 02:19:23,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:19:23,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:19:23,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label09.c[6533,6546] [2025-03-08 02:19:23,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:19:24,011 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:19:24,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24 WrapperNode [2025-03-08 02:19:24,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:19:24,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:19:24,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:19:24,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:19:24,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:24,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:24,560 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:19:24,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:19:24,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:19:24,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:19:24,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:19:24,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:24,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:24,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:24,922 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:19:24,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:24,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:25,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:25,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:25,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:25,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:25,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:19:25,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:19:25,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:19:25,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:19:25,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (1/1) ... [2025-03-08 02:19:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:19:25,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:19:25,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:19:25,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:19:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:19:25,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:19:25,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:19:25,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:19:25,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:19:25,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:19:31,351 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:19:31,351 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:19:31,351 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:19:31,351 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:19:31,352 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:19:31,570 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:19:31,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:19:31,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:19:31,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:19:31,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:31 BoogieIcfgContainer [2025-03-08 02:19:31,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:19:31,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:19:31,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:19:31,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:19:31,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:19:22" (1/3) ... [2025-03-08 02:19:31,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386fd790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:31, skipping insertion in model container [2025-03-08 02:19:31,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:19:24" (2/3) ... [2025-03-08 02:19:31,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386fd790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:31, skipping insertion in model container [2025-03-08 02:19:31,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:31" (3/3) ... [2025-03-08 02:19:31,630 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label09.c [2025-03-08 02:19:31,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:19:31,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label09.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:19:31,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:19:31,738 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;@5f1aad07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:19:31,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:19:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 02:19:31,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:31,754 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, 1, 1] [2025-03-08 02:19:31,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:31,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1186695424, now seen corresponding path program 1 times [2025-03-08 02:19:31,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993820920] [2025-03-08 02:19:31,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:31,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 02:19:31,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 02:19:31,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:31,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:19:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993820920] [2025-03-08 02:19:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993820920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:19:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533884881] [2025-03-08 02:19:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:32,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:19:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:32,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:19:32,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:19:32,239 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:41,282 INFO L93 Difference]: Finished difference Result 6335 states and 12135 transitions. [2025-03-08 02:19:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:19:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-08 02:19:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:41,307 INFO L225 Difference]: With dead ends: 6335 [2025-03-08 02:19:41,307 INFO L226 Difference]: Without dead ends: 4520 [2025-03-08 02:19:41,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:19:41,316 INFO L435 NwaCegarLoop]: 1917 mSDtfsCounter, 4256 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 11295 mSolverCounterSat, 2249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4256 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 13544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2249 IncrementalHoareTripleChecker+Valid, 11295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:41,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4256 Valid, 2197 Invalid, 13544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2249 Valid, 11295 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-03-08 02:19:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2025-03-08 02:19:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 4469. [2025-03-08 02:19:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4469 states, 4468 states have (on average 1.5980304386750224) internal successors, (7140), 4468 states have internal predecessors, (7140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 7140 transitions. [2025-03-08 02:19:41,447 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 7140 transitions. Word has length 49 [2025-03-08 02:19:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:41,448 INFO L471 AbstractCegarLoop]: Abstraction has 4469 states and 7140 transitions. [2025-03-08 02:19:41,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 7140 transitions. [2025-03-08 02:19:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-08 02:19:41,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:41,456 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:19:41,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:19:41,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:41,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:41,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1964367256, now seen corresponding path program 1 times [2025-03-08 02:19:41,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:41,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084931590] [2025-03-08 02:19:41,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:41,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:41,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-08 02:19:41,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-08 02:19:41,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:41,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:19:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084931590] [2025-03-08 02:19:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084931590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:19:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593995514] [2025-03-08 02:19:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:19:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:42,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:19:42,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:19:42,133 INFO L87 Difference]: Start difference. First operand 4469 states and 7140 transitions. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:46,257 INFO L93 Difference]: Finished difference Result 7602 states and 12932 transitions. [2025-03-08 02:19:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:19:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2025-03-08 02:19:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:46,272 INFO L225 Difference]: With dead ends: 7602 [2025-03-08 02:19:46,272 INFO L226 Difference]: Without dead ends: 4469 [2025-03-08 02:19:46,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:19:46,278 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5716 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 5724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:46,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1950 Invalid, 5724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5716 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 02:19:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2025-03-08 02:19:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4469. [2025-03-08 02:19:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4469 states, 4468 states have (on average 1.596016114592659) internal successors, (7131), 4468 states have internal predecessors, (7131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 7131 transitions. [2025-03-08 02:19:46,415 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 7131 transitions. Word has length 284 [2025-03-08 02:19:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:46,416 INFO L471 AbstractCegarLoop]: Abstraction has 4469 states and 7131 transitions. [2025-03-08 02:19:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 7131 transitions. [2025-03-08 02:19:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-08 02:19:46,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:46,426 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:19:46,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:19:46,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:46,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1570119977, now seen corresponding path program 1 times [2025-03-08 02:19:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:46,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269342673] [2025-03-08 02:19:46,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:46,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-08 02:19:46,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-08 02:19:46,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:46,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 02:19:47,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:47,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269342673] [2025-03-08 02:19:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269342673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:19:47,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784176515] [2025-03-08 02:19:47,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:47,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:19:47,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:19:47,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:19:47,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:19:47,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-08 02:19:47,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-08 02:19:47,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:47,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:47,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:19:47,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:19:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 02:19:48,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:19:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784176515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:48,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:19:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 02:19:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993665551] [2025-03-08 02:19:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:48,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:48,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:48,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:19:48,215 INFO L87 Difference]: Start difference. First operand 4469 states and 7131 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:52,325 INFO L93 Difference]: Finished difference Result 10339 states and 18164 transitions. [2025-03-08 02:19:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:19:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 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 536 [2025-03-08 02:19:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:52,344 INFO L225 Difference]: With dead ends: 10339 [2025-03-08 02:19:52,344 INFO L226 Difference]: Without dead ends: 7237 [2025-03-08 02:19:52,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:19:52,351 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 1058 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4577 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:52,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1388 Invalid, 5627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4577 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 02:19:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7237 states. [2025-03-08 02:19:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7237 to 7236. [2025-03-08 02:19:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7236 states, 7235 states have (on average 1.520110573600553) internal successors, (10998), 7235 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 10998 transitions. [2025-03-08 02:19:52,453 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 10998 transitions. Word has length 536 [2025-03-08 02:19:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:52,454 INFO L471 AbstractCegarLoop]: Abstraction has 7236 states and 10998 transitions. [2025-03-08 02:19:52,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 10998 transitions. [2025-03-08 02:19:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-08 02:19:52,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:52,461 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:19:52,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:19:52,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:19:52,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:52,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1204483643, now seen corresponding path program 1 times [2025-03-08 02:19:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667348455] [2025-03-08 02:19:52,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:52,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-08 02:19:52,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-08 02:19:52,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:52,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:19:53,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667348455] [2025-03-08 02:19:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667348455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:19:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759194036] [2025-03-08 02:19:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:53,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:53,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:53,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:19:53,439 INFO L87 Difference]: Start difference. First operand 7236 states and 10998 transitions. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:57,826 INFO L93 Difference]: Finished difference Result 15909 states and 25212 transitions. [2025-03-08 02:19:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:19:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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 601 [2025-03-08 02:19:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:57,859 INFO L225 Difference]: With dead ends: 15909 [2025-03-08 02:19:57,859 INFO L226 Difference]: Without dead ends: 10040 [2025-03-08 02:19:57,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:19:57,867 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1679 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4179 mSolverCounterSat, 2355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 6534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2355 IncrementalHoareTripleChecker+Valid, 4179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:57,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 608 Invalid, 6534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2355 Valid, 4179 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 02:19:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2025-03-08 02:19:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 9992. [2025-03-08 02:19:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9992 states, 9991 states have (on average 1.5234711240116106) internal successors, (15221), 9991 states have internal predecessors, (15221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9992 states to 9992 states and 15221 transitions. [2025-03-08 02:19:58,029 INFO L78 Accepts]: Start accepts. Automaton has 9992 states and 15221 transitions. Word has length 601 [2025-03-08 02:19:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:58,029 INFO L471 AbstractCegarLoop]: Abstraction has 9992 states and 15221 transitions. [2025-03-08 02:19:58,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 9992 states and 15221 transitions. [2025-03-08 02:19:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-08 02:19:58,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:58,040 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:19:58,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:19:58,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:58,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1025157335, now seen corresponding path program 1 times [2025-03-08 02:19:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:58,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95118531] [2025-03-08 02:19:58,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:58,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-08 02:19:58,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-08 02:19:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 02:19:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95118531] [2025-03-08 02:19:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95118531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:19:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358533048] [2025-03-08 02:19:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:58,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:58,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:58,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:19:58,383 INFO L87 Difference]: Start difference. First operand 9992 states and 15221 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:02,216 INFO L93 Difference]: Finished difference Result 22712 states and 34730 transitions. [2025-03-08 02:20:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:20:02,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 0 states have call successors, (0), 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 612 [2025-03-08 02:20:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:02,238 INFO L225 Difference]: With dead ends: 22712 [2025-03-08 02:20:02,239 INFO L226 Difference]: Without dead ends: 14087 [2025-03-08 02:20:02,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:02,247 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 1395 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 1668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 5595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1668 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:02,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 749 Invalid, 5595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1668 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 02:20:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14087 states. [2025-03-08 02:20:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14087 to 14083. [2025-03-08 02:20:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14083 states, 14082 states have (on average 1.3862377503195569) internal successors, (19521), 14082 states have internal predecessors, (19521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14083 states to 14083 states and 19521 transitions. [2025-03-08 02:20:02,382 INFO L78 Accepts]: Start accepts. Automaton has 14083 states and 19521 transitions. Word has length 612 [2025-03-08 02:20:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:02,382 INFO L471 AbstractCegarLoop]: Abstraction has 14083 states and 19521 transitions. [2025-03-08 02:20:02,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 14083 states and 19521 transitions. [2025-03-08 02:20:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-03-08 02:20:02,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:02,389 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:02,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:20:02,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:02,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash -870580437, now seen corresponding path program 1 times [2025-03-08 02:20:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:02,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897253954] [2025-03-08 02:20:02,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:02,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-03-08 02:20:02,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-03-08 02:20:02,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:02,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 02:20:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897253954] [2025-03-08 02:20:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897253954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:02,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:20:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516044395] [2025-03-08 02:20:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:02,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:20:02,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:02,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:20:02,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:02,915 INFO L87 Difference]: Start difference. First operand 14083 states and 19521 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:07,203 INFO L93 Difference]: Finished difference Result 39281 states and 55535 transitions. [2025-03-08 02:20:07,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:20:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 0 states have call successors, (0), 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 625 [2025-03-08 02:20:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:07,238 INFO L225 Difference]: With dead ends: 39281 [2025-03-08 02:20:07,239 INFO L226 Difference]: Without dead ends: 26565 [2025-03-08 02:20:07,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:07,251 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1361 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 4184 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:07,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1599 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4184 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 02:20:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26565 states. [2025-03-08 02:20:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26565 to 26550. [2025-03-08 02:20:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26550 states, 26549 states have (on average 1.2714226524539531) internal successors, (33755), 26549 states have internal predecessors, (33755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26550 states to 26550 states and 33755 transitions. [2025-03-08 02:20:07,577 INFO L78 Accepts]: Start accepts. Automaton has 26550 states and 33755 transitions. Word has length 625 [2025-03-08 02:20:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:07,578 INFO L471 AbstractCegarLoop]: Abstraction has 26550 states and 33755 transitions. [2025-03-08 02:20:07,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26550 states and 33755 transitions. [2025-03-08 02:20:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2025-03-08 02:20:07,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:07,583 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:07,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:20:07,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:07,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 48245523, now seen corresponding path program 1 times [2025-03-08 02:20:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:07,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424297613] [2025-03-08 02:20:07,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:07,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-03-08 02:20:07,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-03-08 02:20:07,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:07,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:20:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424297613] [2025-03-08 02:20:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424297613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:08,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:20:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901080385] [2025-03-08 02:20:08,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:08,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:20:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:08,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:20:08,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:20:08,485 INFO L87 Difference]: Start difference. First operand 26550 states and 33755 transitions. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:14,381 INFO L93 Difference]: Finished difference Result 61326 states and 76888 transitions. [2025-03-08 02:20:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:20:14,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 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 640 [2025-03-08 02:20:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:14,421 INFO L225 Difference]: With dead ends: 61326 [2025-03-08 02:20:14,422 INFO L226 Difference]: Without dead ends: 36117 [2025-03-08 02:20:14,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:20:14,434 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 2256 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 10055 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 10449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 10055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:14,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2256 Valid, 1874 Invalid, 10449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 10055 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-08 02:20:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36117 states. [2025-03-08 02:20:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36117 to 34747. [2025-03-08 02:20:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34747 states, 34746 states have (on average 1.2173775398607034) internal successors, (42299), 34746 states have internal predecessors, (42299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34747 states to 34747 states and 42299 transitions. [2025-03-08 02:20:14,725 INFO L78 Accepts]: Start accepts. Automaton has 34747 states and 42299 transitions. Word has length 640 [2025-03-08 02:20:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:14,725 INFO L471 AbstractCegarLoop]: Abstraction has 34747 states and 42299 transitions. [2025-03-08 02:20:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34747 states and 42299 transitions. [2025-03-08 02:20:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-08 02:20:14,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:14,729 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:14,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:20:14,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -160622224, now seen corresponding path program 1 times [2025-03-08 02:20:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904857529] [2025-03-08 02:20:14,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:14,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-08 02:20:14,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-08 02:20:14,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-08 02:20:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904857529] [2025-03-08 02:20:15,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904857529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:15,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:15,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457300218] [2025-03-08 02:20:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:15,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:20:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:15,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:20:15,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:15,349 INFO L87 Difference]: Start difference. First operand 34747 states and 42299 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:20,104 INFO L93 Difference]: Finished difference Result 88697 states and 110128 transitions. [2025-03-08 02:20:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:20:20,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 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 685 [2025-03-08 02:20:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:20,238 INFO L225 Difference]: With dead ends: 88697 [2025-03-08 02:20:20,238 INFO L226 Difference]: Without dead ends: 55317 [2025-03-08 02:20:20,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:20,257 INFO L435 NwaCegarLoop]: 3158 mSDtfsCounter, 1538 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 4931 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 5902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 4931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:20,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 3376 Invalid, 5902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 4931 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 02:20:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55317 states. [2025-03-08 02:20:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55317 to 55274. [2025-03-08 02:20:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55274 states, 55273 states have (on average 1.1719827040327104) internal successors, (64779), 55273 states have internal predecessors, (64779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55274 states to 55274 states and 64779 transitions. [2025-03-08 02:20:20,689 INFO L78 Accepts]: Start accepts. Automaton has 55274 states and 64779 transitions. Word has length 685 [2025-03-08 02:20:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:20,690 INFO L471 AbstractCegarLoop]: Abstraction has 55274 states and 64779 transitions. [2025-03-08 02:20:20,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 55274 states and 64779 transitions. [2025-03-08 02:20:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-03-08 02:20:20,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:20,694 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:20,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:20:20,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:20,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1342588598, now seen corresponding path program 1 times [2025-03-08 02:20:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:20,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500527452] [2025-03-08 02:20:20,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:20,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:20,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-03-08 02:20:20,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-03-08 02:20:20,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:20,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-08 02:20:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:21,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500527452] [2025-03-08 02:20:21,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500527452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:21,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:21,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:21,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933992842] [2025-03-08 02:20:21,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:21,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:20:21,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:21,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:20:21,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:21,809 INFO L87 Difference]: Start difference. First operand 55274 states and 64779 transitions. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:26,452 INFO L93 Difference]: Finished difference Result 107881 states and 126882 transitions. [2025-03-08 02:20:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:20:26,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 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 711 [2025-03-08 02:20:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:26,502 INFO L225 Difference]: With dead ends: 107881 [2025-03-08 02:20:26,502 INFO L226 Difference]: Without dead ends: 53913 [2025-03-08 02:20:26,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:26,522 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 977 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 7403 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 7420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 7403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:26,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 2010 Invalid, 7420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 7403 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 02:20:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53913 states. [2025-03-08 02:20:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53913 to 53909. [2025-03-08 02:20:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53909 states, 53908 states have (on average 1.1750575053795356) internal successors, (63345), 53908 states have internal predecessors, (63345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53909 states to 53909 states and 63345 transitions. [2025-03-08 02:20:26,920 INFO L78 Accepts]: Start accepts. Automaton has 53909 states and 63345 transitions. Word has length 711 [2025-03-08 02:20:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:26,921 INFO L471 AbstractCegarLoop]: Abstraction has 53909 states and 63345 transitions. [2025-03-08 02:20:26,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 53909 states and 63345 transitions. [2025-03-08 02:20:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-08 02:20:26,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:26,927 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:26,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:20:26,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash -206219558, now seen corresponding path program 1 times [2025-03-08 02:20:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256811556] [2025-03-08 02:20:26,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:26,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-08 02:20:27,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-08 02:20:27,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-03-08 02:20:27,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:27,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256811556] [2025-03-08 02:20:27,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256811556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:27,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:27,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257444701] [2025-03-08 02:20:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:27,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:20:27,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:27,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:20:27,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:27,559 INFO L87 Difference]: Start difference. First operand 53909 states and 63345 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:32,139 INFO L93 Difference]: Finished difference Result 132412 states and 158149 transitions. [2025-03-08 02:20:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:20:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 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 734 [2025-03-08 02:20:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:32,291 INFO L225 Difference]: With dead ends: 132412 [2025-03-08 02:20:32,291 INFO L226 Difference]: Without dead ends: 79870 [2025-03-08 02:20:32,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:32,310 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 1390 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 4104 mSolverCounterSat, 1663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 5767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1663 IncrementalHoareTripleChecker+Valid, 4104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:32,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 1925 Invalid, 5767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1663 Valid, 4104 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 02:20:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79870 states. [2025-03-08 02:20:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79870 to 60686. [2025-03-08 02:20:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60686 states, 60685 states have (on average 1.1583752162807943) internal successors, (70296), 60685 states have internal predecessors, (70296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60686 states to 60686 states and 70296 transitions. [2025-03-08 02:20:32,826 INFO L78 Accepts]: Start accepts. Automaton has 60686 states and 70296 transitions. Word has length 734 [2025-03-08 02:20:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:32,826 INFO L471 AbstractCegarLoop]: Abstraction has 60686 states and 70296 transitions. [2025-03-08 02:20:32,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 60686 states and 70296 transitions. [2025-03-08 02:20:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-08 02:20:32,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:32,832 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:32,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:20:32,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:32,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2041589186, now seen corresponding path program 1 times [2025-03-08 02:20:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:32,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875652770] [2025-03-08 02:20:32,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:32,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-08 02:20:33,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-08 02:20:33,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:33,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 02:20:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:33,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875652770] [2025-03-08 02:20:33,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875652770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:33,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:20:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968491904] [2025-03-08 02:20:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:33,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:20:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:33,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:20:33,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:33,484 INFO L87 Difference]: Start difference. First operand 60686 states and 70296 transitions. Second operand has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:40,863 INFO L93 Difference]: Finished difference Result 182934 states and 214878 transitions. [2025-03-08 02:20:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:20:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 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 833 [2025-03-08 02:20:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:41,001 INFO L225 Difference]: With dead ends: 182934 [2025-03-08 02:20:41,001 INFO L226 Difference]: Without dead ends: 123615 [2025-03-08 02:20:41,030 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-03-08 02:20:41,030 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 3349 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 8712 mSolverCounterSat, 2838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3349 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 11550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2838 IncrementalHoareTripleChecker+Valid, 8712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:41,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3349 Valid, 956 Invalid, 11550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2838 Valid, 8712 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-08 02:20:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123615 states. [2025-03-08 02:20:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123615 to 109874. [2025-03-08 02:20:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109874 states, 109873 states have (on average 1.159293001920399) internal successors, (127375), 109873 states have internal predecessors, (127375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109874 states to 109874 states and 127375 transitions. [2025-03-08 02:20:42,108 INFO L78 Accepts]: Start accepts. Automaton has 109874 states and 127375 transitions. Word has length 833 [2025-03-08 02:20:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:42,109 INFO L471 AbstractCegarLoop]: Abstraction has 109874 states and 127375 transitions. [2025-03-08 02:20:42,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 109874 states and 127375 transitions. [2025-03-08 02:20:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-03-08 02:20:42,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:42,116 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, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:42,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:20:42,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:42,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:42,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1724485622, now seen corresponding path program 1 times [2025-03-08 02:20:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:42,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063375432] [2025-03-08 02:20:42,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:42,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:42,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-03-08 02:20:42,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-03-08 02:20:42,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:42,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat