./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label50.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 c0a29c0650858169a7f06788e2d55d3441e7b25ce879ddd70ee1db162c004af4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:03:35,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:03:35,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:03:35,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:03:35,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:03:35,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:03:35,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:03:35,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:03:35,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:03:35,624 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:03:35,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:03:35,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:03:35,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:03:35,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:03:35,625 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:03:35,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:03:35,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:03:35,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:03:35,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:03:35,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:03:35,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:03:35,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:03:35,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:03:35,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:03:35,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:03:35,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:03:35,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:03:35,628 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 -> c0a29c0650858169a7f06788e2d55d3441e7b25ce879ddd70ee1db162c004af4 [2025-03-16 15:03:35,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:03:35,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:03:35,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:03:35,893 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:03:35,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:03:35,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label50.c [2025-03-16 15:03:37,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b964195/b96cac3c38394a63b1dccc3e7f99fd5e/FLAG69a0d73bb [2025-03-16 15:03:37,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:03:37,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label50.c [2025-03-16 15:03:37,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b964195/b96cac3c38394a63b1dccc3e7f99fd5e/FLAG69a0d73bb [2025-03-16 15:03:37,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b964195/b96cac3c38394a63b1dccc3e7f99fd5e [2025-03-16 15:03:37,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:03:37,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:03:37,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:03:37,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:03:37,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:03:37,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:03:37" (1/1) ... [2025-03-16 15:03:37,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fad818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:37, skipping insertion in model container [2025-03-16 15:03:37,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:03:37" (1/1) ... [2025-03-16 15:03:37,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:03:37,810 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/Problem13_label50.c[8814,8827] [2025-03-16 15:03:38,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:03:38,253 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:03:38,271 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/Problem13_label50.c[8814,8827] [2025-03-16 15:03:38,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:03:38,587 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:03:38,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38 WrapperNode [2025-03-16 15:03:38,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:03:38,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:03:38,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:03:38,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:03:38,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:38,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:38,970 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:03:38,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:03:38,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:03:38,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:03:38,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:03:38,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:38,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,262 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-16 15:03:39,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:03:39,519 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:03:39,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:03:39,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:03:39,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (1/1) ... [2025-03-16 15:03:39,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:03:39,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:03:39,545 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-16 15:03:39,549 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-16 15:03:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:03:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:03:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:03:39,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:03:39,614 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:03:39,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:03:43,396 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:03:43,397 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:03:43,397 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:03:43,570 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:03:43,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:03:43,604 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:03:43,604 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:03:43,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:03:43 BoogieIcfgContainer [2025-03-16 15:03:43,604 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:03:43,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:03:43,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:03:43,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:03:43,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:03:37" (1/3) ... [2025-03-16 15:03:43,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91bd18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:03:43, skipping insertion in model container [2025-03-16 15:03:43,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:03:38" (2/3) ... [2025-03-16 15:03:43,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91bd18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:03:43, skipping insertion in model container [2025-03-16 15:03:43,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:03:43" (3/3) ... [2025-03-16 15:03:43,611 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label50.c [2025-03-16 15:03:43,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:03:43,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label50.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:03:43,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:03:43,707 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;@4a403f4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:03:43,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:03:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 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-16 15:03:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 15:03:43,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:43,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:43,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1606382970, now seen corresponding path program 1 times [2025-03-16 15:03:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554750499] [2025-03-16 15:03:43,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:43,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:43,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 15:03:43,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 15:03:43,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:43,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:43,836 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-16 15:03:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554750499] [2025-03-16 15:03:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554750499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084297982] [2025-03-16 15:03:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:43,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:03:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:43,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:03:43,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:03:43,857 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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-16 15:03:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:43,922 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:03:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:03:43,923 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 15:03:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:43,938 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:03:43,938 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:03:43,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:03:43,947 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:43,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:03:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:03:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:03:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 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-16 15:03:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:03:44,027 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 61 [2025-03-16 15:03:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:44,027 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:03:44,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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-16 15:03:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:03:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 15:03:44,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:44,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:44,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:03:44,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:44,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1677080326, now seen corresponding path program 1 times [2025-03-16 15:03:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:44,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983766382] [2025-03-16 15:03:44,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:44,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 15:03:44,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 15:03:44,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:44,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:44,274 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-16 15:03:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983766382] [2025-03-16 15:03:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983766382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760973722] [2025-03-16 15:03:44,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:44,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:44,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:44,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:44,276 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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-16 15:03:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:48,029 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2025-03-16 15:03:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 15:03:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:48,036 INFO L225 Difference]: With dead ends: 2976 [2025-03-16 15:03:48,036 INFO L226 Difference]: Without dead ends: 1943 [2025-03-16 15:03:48,037 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-16 15:03:48,038 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 893 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:48,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 535 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-16 15:03:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-03-16 15:03:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2025-03-16 15:03:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 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-16 15:03:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2025-03-16 15:03:48,083 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 61 [2025-03-16 15:03:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:48,083 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2025-03-16 15:03:48,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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-16 15:03:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2025-03-16 15:03:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 15:03:48,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:48,088 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:48,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:03:48,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:48,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -429837619, now seen corresponding path program 1 times [2025-03-16 15:03:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:48,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595677256] [2025-03-16 15:03:48,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:48,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 15:03:48,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 15:03:48,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:48,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:48,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595677256] [2025-03-16 15:03:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595677256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793081760] [2025-03-16 15:03:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:48,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:48,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:48,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:48,380 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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-16 15:03:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:51,042 INFO L93 Difference]: Finished difference Result 4603 states and 7963 transitions. [2025-03-16 15:03:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:51,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 15:03:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:51,053 INFO L225 Difference]: With dead ends: 4603 [2025-03-16 15:03:51,053 INFO L226 Difference]: Without dead ends: 2732 [2025-03-16 15:03:51,056 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-16 15:03:51,056 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:51,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 737 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:03:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2025-03-16 15:03:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2669. [2025-03-16 15:03:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 1.6581709145427286) internal successors, (4424), 2668 states have internal predecessors, (4424), 0 states have call successors, (0), 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-16 15:03:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4424 transitions. [2025-03-16 15:03:51,098 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4424 transitions. Word has length 126 [2025-03-16 15:03:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:51,098 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4424 transitions. [2025-03-16 15:03:51,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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-16 15:03:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4424 transitions. [2025-03-16 15:03:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 15:03:51,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:51,100 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:51,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:03:51,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:51,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:51,101 INFO L85 PathProgramCache]: Analyzing trace with hash -793964545, now seen corresponding path program 1 times [2025-03-16 15:03:51,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:51,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938333965] [2025-03-16 15:03:51,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:51,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 15:03:51,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 15:03:51,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:51,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:51,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938333965] [2025-03-16 15:03:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938333965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909032018] [2025-03-16 15:03:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:51,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:51,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:51,305 INFO L87 Difference]: Start difference. First operand 2669 states and 4424 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 15:03:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:53,923 INFO L93 Difference]: Finished difference Result 7731 states and 12863 transitions. [2025-03-16 15:03:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:53,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-16 15:03:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:53,940 INFO L225 Difference]: With dead ends: 7731 [2025-03-16 15:03:53,940 INFO L226 Difference]: Without dead ends: 5063 [2025-03-16 15:03:53,945 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-16 15:03:53,946 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:53,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1135 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:03:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2025-03-16 15:03:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 5062. [2025-03-16 15:03:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 5061 states have (on average 1.4546532305868405) internal successors, (7362), 5061 states have internal predecessors, (7362), 0 states have call successors, (0), 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-16 15:03:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 7362 transitions. [2025-03-16 15:03:54,033 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 7362 transitions. Word has length 127 [2025-03-16 15:03:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:54,033 INFO L471 AbstractCegarLoop]: Abstraction has 5062 states and 7362 transitions. [2025-03-16 15:03:54,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 15:03:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 7362 transitions. [2025-03-16 15:03:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 15:03:54,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:54,040 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, 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] [2025-03-16 15:03:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:03:54,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:54,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash -571572157, now seen corresponding path program 1 times [2025-03-16 15:03:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347662156] [2025-03-16 15:03:54,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 15:03:54,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 15:03:54,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347662156] [2025-03-16 15:03:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347662156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410316204] [2025-03-16 15:03:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:54,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:54,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:54,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:54,167 INFO L87 Difference]: Start difference. First operand 5062 states and 7362 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-16 15:03:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:56,717 INFO L93 Difference]: Finished difference Result 12514 states and 18431 transitions. [2025-03-16 15:03:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-16 15:03:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:56,738 INFO L225 Difference]: With dead ends: 12514 [2025-03-16 15:03:56,738 INFO L226 Difference]: Without dead ends: 7453 [2025-03-16 15:03:56,745 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-16 15:03:56,745 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 872 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:56,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:03:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-03-16 15:03:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7443. [2025-03-16 15:03:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 7442 states have (on average 1.3368718086535878) internal successors, (9949), 7442 states have internal predecessors, (9949), 0 states have call successors, (0), 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-16 15:03:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 9949 transitions. [2025-03-16 15:03:56,830 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 9949 transitions. Word has length 130 [2025-03-16 15:03:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 7443 states and 9949 transitions. [2025-03-16 15:03:56,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-16 15:03:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 9949 transitions. [2025-03-16 15:03:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 15:03:56,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:56,832 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:56,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:03:56,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:56,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash -367946537, now seen corresponding path program 1 times [2025-03-16 15:03:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:56,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431516122] [2025-03-16 15:03:56,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:56,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 15:03:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 15:03:56,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:56,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431516122] [2025-03-16 15:03:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431516122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:56,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:56,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860313014] [2025-03-16 15:03:56,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:56,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:56,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:56,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:56,989 INFO L87 Difference]: Start difference. First operand 7443 states and 9949 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-16 15:03:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:59,363 INFO L93 Difference]: Finished difference Result 20423 states and 27780 transitions. [2025-03-16 15:03:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-16 15:03:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:59,392 INFO L225 Difference]: With dead ends: 20423 [2025-03-16 15:03:59,392 INFO L226 Difference]: Without dead ends: 13768 [2025-03-16 15:03:59,400 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-16 15:03:59,400 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 805 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:59,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1160 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:03:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2025-03-16 15:03:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 12961. [2025-03-16 15:03:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.2383487654320988) internal successors, (16049), 12960 states have internal predecessors, (16049), 0 states have call successors, (0), 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-16 15:03:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16049 transitions. [2025-03-16 15:03:59,543 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16049 transitions. Word has length 134 [2025-03-16 15:03:59,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16049 transitions. [2025-03-16 15:03:59,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-16 15:03:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16049 transitions. [2025-03-16 15:03:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 15:03:59,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:59,545 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, 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] [2025-03-16 15:03:59,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:03:59,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:59,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1571043541, now seen corresponding path program 1 times [2025-03-16 15:03:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43678401] [2025-03-16 15:03:59,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:59,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:59,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 15:03:59,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 15:03:59,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:59,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:03:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43678401] [2025-03-16 15:03:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43678401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:59,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:59,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:03:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588499989] [2025-03-16 15:03:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:59,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:59,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:59,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:59,740 INFO L87 Difference]: Start difference. First operand 12961 states and 16049 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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-16 15:04:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:01,816 INFO L93 Difference]: Finished difference Result 25134 states and 31300 transitions. [2025-03-16 15:04:01,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-16 15:04:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:01,836 INFO L225 Difference]: With dead ends: 25134 [2025-03-16 15:04:01,836 INFO L226 Difference]: Without dead ends: 12961 [2025-03-16 15:04:01,847 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-16 15:04:01,848 INFO L435 NwaCegarLoop]: 1082 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:01,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1211 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:04:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2025-03-16 15:04:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2025-03-16 15:04:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.237962962962963) internal successors, (16044), 12960 states have internal predecessors, (16044), 0 states have call successors, (0), 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-16 15:04:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16044 transitions. [2025-03-16 15:04:02,060 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16044 transitions. Word has length 150 [2025-03-16 15:04:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:02,060 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16044 transitions. [2025-03-16 15:04:02,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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-16 15:04:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16044 transitions. [2025-03-16 15:04:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 15:04:02,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:02,062 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, 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] [2025-03-16 15:04:02,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:04:02,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:02,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1272101301, now seen corresponding path program 1 times [2025-03-16 15:04:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612372143] [2025-03-16 15:04:02,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:02,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 15:04:02,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 15:04:02,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:02,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:02,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612372143] [2025-03-16 15:04:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612372143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:02,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:02,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:02,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700889974] [2025-03-16 15:04:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:02,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:02,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:02,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:02,149 INFO L87 Difference]: Start difference. First operand 12961 states and 16044 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:04,761 INFO L93 Difference]: Finished difference Result 31447 states and 39969 transitions. [2025-03-16 15:04:04,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:04,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-16 15:04:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:04,784 INFO L225 Difference]: With dead ends: 31447 [2025-03-16 15:04:04,785 INFO L226 Difference]: Without dead ends: 19274 [2025-03-16 15:04:04,797 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-16 15:04:04,798 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 900 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:04,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 956 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:04:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2025-03-16 15:04:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 18477. [2025-03-16 15:04:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18477 states, 18476 states have (on average 1.2248322147651007) internal successors, (22630), 18476 states have internal predecessors, (22630), 0 states have call successors, (0), 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-16 15:04:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18477 states to 18477 states and 22630 transitions. [2025-03-16 15:04:04,973 INFO L78 Accepts]: Start accepts. Automaton has 18477 states and 22630 transitions. Word has length 157 [2025-03-16 15:04:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:04,973 INFO L471 AbstractCegarLoop]: Abstraction has 18477 states and 22630 transitions. [2025-03-16 15:04:04,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 18477 states and 22630 transitions. [2025-03-16 15:04:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 15:04:04,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:04,978 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:04,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:04:04,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:04,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash -842252550, now seen corresponding path program 1 times [2025-03-16 15:04:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394732323] [2025-03-16 15:04:04,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:04,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 15:04:05,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 15:04:05,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:05,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-16 15:04:05,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394732323] [2025-03-16 15:04:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394732323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:04:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821466183] [2025-03-16 15:04:05,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:05,261 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-16 15:04:05,264 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-16 15:04:05,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 15:04:05,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 15:04:05,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:05,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:05,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:04:05,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:04:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-16 15:04:05,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:04:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821466183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:05,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:04:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:04:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425565361] [2025-03-16 15:04:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:05,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:05,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:05,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:04:05,690 INFO L87 Difference]: Start difference. First operand 18477 states and 22630 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-16 15:04:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:08,122 INFO L93 Difference]: Finished difference Result 53636 states and 66030 transitions. [2025-03-16 15:04:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:08,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 246 [2025-03-16 15:04:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:08,158 INFO L225 Difference]: With dead ends: 53636 [2025-03-16 15:04:08,158 INFO L226 Difference]: Without dead ends: 35947 [2025-03-16 15:04:08,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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-16 15:04:08,177 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 1045 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 3238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:08,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1088 Invalid, 3238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:04:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35947 states. [2025-03-16 15:04:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35947 to 35929. [2025-03-16 15:04:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35929 states, 35928 states have (on average 1.1822812291249165) internal successors, (42477), 35928 states have internal predecessors, (42477), 0 states have call successors, (0), 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-16 15:04:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35929 states to 35929 states and 42477 transitions. [2025-03-16 15:04:08,464 INFO L78 Accepts]: Start accepts. Automaton has 35929 states and 42477 transitions. Word has length 246 [2025-03-16 15:04:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:08,465 INFO L471 AbstractCegarLoop]: Abstraction has 35929 states and 42477 transitions. [2025-03-16 15:04:08,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-16 15:04:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 35929 states and 42477 transitions. [2025-03-16 15:04:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-16 15:04:08,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:08,468 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:04:08,474 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-16 15:04:08,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:08,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1814880157, now seen corresponding path program 1 times [2025-03-16 15:04:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514035348] [2025-03-16 15:04:08,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:08,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-16 15:04:08,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-16 15:04:08,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:08,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514035348] [2025-03-16 15:04:08,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514035348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:08,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:08,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746094218] [2025-03-16 15:04:08,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:08,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:08,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:08,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:08,781 INFO L87 Difference]: Start difference. First operand 35929 states and 42477 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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-16 15:04:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:11,124 INFO L93 Difference]: Finished difference Result 70919 states and 83954 transitions. [2025-03-16 15:04:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:11,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-03-16 15:04:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:11,164 INFO L225 Difference]: With dead ends: 70919 [2025-03-16 15:04:11,165 INFO L226 Difference]: Without dead ends: 35778 [2025-03-16 15:04:11,190 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-16 15:04:11,190 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 1036 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:11,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1645 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:04:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35778 states. [2025-03-16 15:04:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35778 to 34200. [2025-03-16 15:04:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34200 states, 34199 states have (on average 1.129594432585748) internal successors, (38631), 34199 states have internal predecessors, (38631), 0 states have call successors, (0), 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-16 15:04:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34200 states to 34200 states and 38631 transitions. [2025-03-16 15:04:11,491 INFO L78 Accepts]: Start accepts. Automaton has 34200 states and 38631 transitions. Word has length 275 [2025-03-16 15:04:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:11,491 INFO L471 AbstractCegarLoop]: Abstraction has 34200 states and 38631 transitions. [2025-03-16 15:04:11,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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-16 15:04:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 34200 states and 38631 transitions. [2025-03-16 15:04:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-16 15:04:11,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:11,496 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:11,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:04:11,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:11,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1178581852, now seen corresponding path program 1 times [2025-03-16 15:04:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600238630] [2025-03-16 15:04:11,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:11,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-16 15:04:11,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-16 15:04:11,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:11,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 15:04:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:11,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600238630] [2025-03-16 15:04:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600238630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:11,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:11,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955678852] [2025-03-16 15:04:11,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:11,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:11,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:11,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:11,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:11,672 INFO L87 Difference]: Start difference. First operand 34200 states and 38631 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-16 15:04:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:16,489 INFO L93 Difference]: Finished difference Result 100865 states and 114145 transitions. [2025-03-16 15:04:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:04:16,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 349 [2025-03-16 15:04:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:16,559 INFO L225 Difference]: With dead ends: 100865 [2025-03-16 15:04:16,559 INFO L226 Difference]: Without dead ends: 67453 [2025-03-16 15:04:16,588 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-16 15:04:16,588 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 1707 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6632 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 7671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 6632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:16,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 810 Invalid, 7671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 6632 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:04:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67453 states. [2025-03-16 15:04:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67453 to 65761. [2025-03-16 15:04:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65761 states, 65760 states have (on average 1.1186283454987835) internal successors, (73561), 65760 states have internal predecessors, (73561), 0 states have call successors, (0), 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-16 15:04:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65761 states to 65761 states and 73561 transitions. [2025-03-16 15:04:17,341 INFO L78 Accepts]: Start accepts. Automaton has 65761 states and 73561 transitions. Word has length 349 [2025-03-16 15:04:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:17,341 INFO L471 AbstractCegarLoop]: Abstraction has 65761 states and 73561 transitions. [2025-03-16 15:04:17,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-16 15:04:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 65761 states and 73561 transitions. [2025-03-16 15:04:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-16 15:04:17,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:17,347 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:17,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:04:17,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:17,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1813032584, now seen corresponding path program 1 times [2025-03-16 15:04:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396435127] [2025-03-16 15:04:17,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:17,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:17,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 15:04:17,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 15:04:17,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:17,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 15:04:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396435127] [2025-03-16 15:04:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396435127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826632504] [2025-03-16 15:04:17,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:17,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:17,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:17,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:17,667 INFO L87 Difference]: Start difference. First operand 65761 states and 73561 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-16 15:04:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:20,178 INFO L93 Difference]: Finished difference Result 133130 states and 148769 transitions. [2025-03-16 15:04:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:20,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 358 [2025-03-16 15:04:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:20,256 INFO L225 Difference]: With dead ends: 133130 [2025-03-16 15:04:20,256 INFO L226 Difference]: Without dead ends: 66578 [2025-03-16 15:04:20,296 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-16 15:04:20,297 INFO L435 NwaCegarLoop]: 1838 mSDtfsCounter, 746 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:20,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1977 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:04:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66578 states. [2025-03-16 15:04:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66578 to 65755. [2025-03-16 15:04:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65755 states, 65754 states have (on average 1.1051038720077866) internal successors, (72665), 65754 states have internal predecessors, (72665), 0 states have call successors, (0), 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-16 15:04:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65755 states to 65755 states and 72665 transitions. [2025-03-16 15:04:21,048 INFO L78 Accepts]: Start accepts. Automaton has 65755 states and 72665 transitions. Word has length 358 [2025-03-16 15:04:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:21,049 INFO L471 AbstractCegarLoop]: Abstraction has 65755 states and 72665 transitions. [2025-03-16 15:04:21,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-16 15:04:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 65755 states and 72665 transitions. [2025-03-16 15:04:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 15:04:21,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:21,054 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, 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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:04:21,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:04:21,054 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -475633637, now seen corresponding path program 1 times [2025-03-16 15:04:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411678527] [2025-03-16 15:04:21,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:21,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 15:04:21,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 15:04:21,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:21,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 291 proven. 110 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 15:04:21,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411678527] [2025-03-16 15:04:21,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411678527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:04:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519084774] [2025-03-16 15:04:21,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:21,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:21,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:21,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:04:21,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:04:21,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 15:04:22,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 15:04:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:22,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:04:22,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:04:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-16 15:04:22,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:04:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519084774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:04:22,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:04:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436296777] [2025-03-16 15:04:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:22,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:22,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:22,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:22,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:22,166 INFO L87 Difference]: Start difference. First operand 65755 states and 72665 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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-16 15:04:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:24,727 INFO L93 Difference]: Finished difference Result 130720 states and 144536 transitions. [2025-03-16 15:04:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:24,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 387 [2025-03-16 15:04:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:24,810 INFO L225 Difference]: With dead ends: 130720 [2025-03-16 15:04:24,810 INFO L226 Difference]: Without dead ends: 65753 [2025-03-16 15:04:24,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:24,847 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 1113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:24,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1418 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:04:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65753 states. [2025-03-16 15:04:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65753 to 65752. [2025-03-16 15:04:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65752 states, 65751 states have (on average 1.0830709799090508) internal successors, (71213), 65751 states have internal predecessors, (71213), 0 states have call successors, (0), 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-16 15:04:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65752 states to 65752 states and 71213 transitions. [2025-03-16 15:04:25,525 INFO L78 Accepts]: Start accepts. Automaton has 65752 states and 71213 transitions. Word has length 387 [2025-03-16 15:04:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:25,525 INFO L471 AbstractCegarLoop]: Abstraction has 65752 states and 71213 transitions. [2025-03-16 15:04:25,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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-16 15:04:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 65752 states and 71213 transitions. [2025-03-16 15:04:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-16 15:04:25,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:25,532 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:04:25,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:04:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:04:25,732 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:25,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2109207787, now seen corresponding path program 1 times [2025-03-16 15:04:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162046984] [2025-03-16 15:04:25,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-16 15:04:25,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-16 15:04:25,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:25,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:04:25,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:25,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162046984] [2025-03-16 15:04:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162046984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:25,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:25,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761001976] [2025-03-16 15:04:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:25,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:25,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:25,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:25,913 INFO L87 Difference]: Start difference. First operand 65752 states and 71213 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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-16 15:04:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:28,880 INFO L93 Difference]: Finished difference Result 154342 states and 168689 transitions. [2025-03-16 15:04:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:28,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 455 [2025-03-16 15:04:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:28,955 INFO L225 Difference]: With dead ends: 154342 [2025-03-16 15:04:28,955 INFO L226 Difference]: Without dead ends: 87017 [2025-03-16 15:04:28,975 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-16 15:04:28,976 INFO L435 NwaCegarLoop]: 1735 mSDtfsCounter, 786 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:28,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1878 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:04:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87017 states. [2025-03-16 15:04:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87017 to 87000. [2025-03-16 15:04:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87000 states, 86999 states have (on average 1.0704835687766525) internal successors, (93131), 86999 states have internal predecessors, (93131), 0 states have call successors, (0), 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-16 15:04:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87000 states to 87000 states and 93131 transitions. [2025-03-16 15:04:29,825 INFO L78 Accepts]: Start accepts. Automaton has 87000 states and 93131 transitions. Word has length 455 [2025-03-16 15:04:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:29,826 INFO L471 AbstractCegarLoop]: Abstraction has 87000 states and 93131 transitions. [2025-03-16 15:04:29,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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-16 15:04:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 87000 states and 93131 transitions. [2025-03-16 15:04:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-16 15:04:29,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:29,836 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:04:29,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:04:29,836 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1170921152, now seen corresponding path program 1 times [2025-03-16 15:04:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:29,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097828409] [2025-03-16 15:04:29,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:29,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 15:04:29,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 15:04:29,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:29,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:04:30,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:30,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097828409] [2025-03-16 15:04:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097828409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:30,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111970696] [2025-03-16 15:04:30,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:30,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:30,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:30,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:30,187 INFO L87 Difference]: Start difference. First operand 87000 states and 93131 transitions. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-16 15:04:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:33,735 INFO L93 Difference]: Finished difference Result 216642 states and 232507 transitions. [2025-03-16 15:04:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 465 [2025-03-16 15:04:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:33,888 INFO L225 Difference]: With dead ends: 216642 [2025-03-16 15:04:33,888 INFO L226 Difference]: Without dead ends: 130430 [2025-03-16 15:04:33,929 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-16 15:04:33,930 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 955 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 3683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:33,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 526 Invalid, 3683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 15:04:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130430 states. [2025-03-16 15:04:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130430 to 125604. [2025-03-16 15:04:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125604 states, 125603 states have (on average 1.0749584006751431) internal successors, (135018), 125603 states have internal predecessors, (135018), 0 states have call successors, (0), 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-16 15:04:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125604 states to 125604 states and 135018 transitions. [2025-03-16 15:04:35,340 INFO L78 Accepts]: Start accepts. Automaton has 125604 states and 135018 transitions. Word has length 465 [2025-03-16 15:04:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:35,341 INFO L471 AbstractCegarLoop]: Abstraction has 125604 states and 135018 transitions. [2025-03-16 15:04:35,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-16 15:04:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 125604 states and 135018 transitions. [2025-03-16 15:04:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-16 15:04:35,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:35,349 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:35,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:04:35,350 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1129283938, now seen corresponding path program 1 times [2025-03-16 15:04:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:35,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714854454] [2025-03-16 15:04:35,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:35,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-16 15:04:35,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-16 15:04:35,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:35,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 360 proven. 110 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 15:04:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714854454] [2025-03-16 15:04:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714854454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:04:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548224492] [2025-03-16 15:04:36,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:36,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:36,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:36,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:04:36,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:04:36,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-16 15:04:36,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-16 15:04:36,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:36,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:04:36,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:04:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-16 15:04:36,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:04:36,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548224492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:36,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:04:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:04:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126991965] [2025-03-16 15:04:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:36,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:36,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:36,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:36,489 INFO L87 Difference]: Start difference. First operand 125604 states and 135018 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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-16 15:04:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:39,982 INFO L93 Difference]: Finished difference Result 303929 states and 327588 transitions. [2025-03-16 15:04:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 477 [2025-03-16 15:04:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:40,165 INFO L225 Difference]: With dead ends: 303929 [2025-03-16 15:04:40,165 INFO L226 Difference]: Without dead ends: 172811 [2025-03-16 15:04:40,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:40,205 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 931 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:40,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1723 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:04:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172811 states. [2025-03-16 15:04:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172811 to 160206. [2025-03-16 15:04:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160206 states, 160205 states have (on average 1.0700290253113198) internal successors, (171424), 160205 states have internal predecessors, (171424), 0 states have call successors, (0), 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-16 15:04:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160206 states to 160206 states and 171424 transitions. [2025-03-16 15:04:41,713 INFO L78 Accepts]: Start accepts. Automaton has 160206 states and 171424 transitions. Word has length 477 [2025-03-16 15:04:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:41,713 INFO L471 AbstractCegarLoop]: Abstraction has 160206 states and 171424 transitions. [2025-03-16 15:04:41,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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-16 15:04:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 160206 states and 171424 transitions. [2025-03-16 15:04:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-16 15:04:41,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:41,723 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:04:41,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:04:41,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:41,924 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:41,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -368603199, now seen corresponding path program 1 times [2025-03-16 15:04:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:41,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624317375] [2025-03-16 15:04:41,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:41,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-16 15:04:41,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-16 15:04:41,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:41,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-16 15:04:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624317375] [2025-03-16 15:04:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624317375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909318527] [2025-03-16 15:04:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:42,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:42,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:42,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:42,094 INFO L87 Difference]: Start difference. First operand 160206 states and 171424 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:45,742 INFO L93 Difference]: Finished difference Result 352691 states and 379808 transitions. [2025-03-16 15:04:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:45,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 518 [2025-03-16 15:04:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:45,996 INFO L225 Difference]: With dead ends: 352691 [2025-03-16 15:04:45,996 INFO L226 Difference]: Without dead ends: 193273 [2025-03-16 15:04:46,082 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-16 15:04:46,083 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 885 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 970 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 970 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:46,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 709 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [970 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:04:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193273 states. [2025-03-16 15:04:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193273 to 191682. [2025-03-16 15:04:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191682 states, 191681 states have (on average 1.073815349460823) internal successors, (205830), 191681 states have internal predecessors, (205830), 0 states have call successors, (0), 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-16 15:04:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191682 states to 191682 states and 205830 transitions. [2025-03-16 15:04:48,524 INFO L78 Accepts]: Start accepts. Automaton has 191682 states and 205830 transitions. Word has length 518 [2025-03-16 15:04:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:48,525 INFO L471 AbstractCegarLoop]: Abstraction has 191682 states and 205830 transitions. [2025-03-16 15:04:48,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 191682 states and 205830 transitions. [2025-03-16 15:04:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-16 15:04:48,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:48,535 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:48,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:04:48,536 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:48,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2126474171, now seen corresponding path program 1 times [2025-03-16 15:04:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:48,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273220957] [2025-03-16 15:04:48,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:48,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-16 15:04:48,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-16 15:04:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:48,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 360 proven. 110 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 15:04:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273220957] [2025-03-16 15:04:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273220957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:04:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135316494] [2025-03-16 15:04:49,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:49,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:49,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:04:49,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:04:49,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-16 15:04:49,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-16 15:04:49,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:49,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:49,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:04:49,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:04:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-16 15:04:49,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:04:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135316494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:49,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:04:49,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:04:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980142185] [2025-03-16 15:04:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:49,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:49,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:49,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:49,974 INFO L87 Difference]: Start difference. First operand 191682 states and 205830 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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-16 15:04:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:52,767 INFO L93 Difference]: Finished difference Result 381783 states and 409968 transitions. [2025-03-16 15:04:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:52,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 533 [2025-03-16 15:04:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:52,986 INFO L225 Difference]: With dead ends: 381783 [2025-03-16 15:04:52,986 INFO L226 Difference]: Without dead ends: 190886 [2025-03-16 15:04:53,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:53,077 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 898 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:53,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1790 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:04:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190886 states. [2025-03-16 15:04:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190886 to 189310. [2025-03-16 15:04:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189310 states, 189309 states have (on average 1.073805260183087) internal successors, (203281), 189309 states have internal predecessors, (203281), 0 states have call successors, (0), 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-16 15:04:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189310 states to 189310 states and 203281 transitions. [2025-03-16 15:04:55,068 INFO L78 Accepts]: Start accepts. Automaton has 189310 states and 203281 transitions. Word has length 533 [2025-03-16 15:04:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:55,068 INFO L471 AbstractCegarLoop]: Abstraction has 189310 states and 203281 transitions. [2025-03-16 15:04:55,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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-16 15:04:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 189310 states and 203281 transitions. [2025-03-16 15:04:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-16 15:04:55,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:55,082 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:04:55,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:04:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:04:55,282 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash -311536026, now seen corresponding path program 1 times [2025-03-16 15:04:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571594747] [2025-03-16 15:04:55,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:55,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-16 15:04:55,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-16 15:04:55,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:55,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-16 15:04:56,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571594747] [2025-03-16 15:04:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571594747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:56,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730426609] [2025-03-16 15:04:56,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:56,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:56,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:56,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:56,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:56,285 INFO L87 Difference]: Start difference. First operand 189310 states and 203281 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)