./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:41:13,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:41:13,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:41:13,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:41:13,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:41:13,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:41:13,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:41:13,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:41:13,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:41:13,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:41:13,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:41:13,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:41:13,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:41:13,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:41:13,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:41:13,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:41:13,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:41:13,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:41:13,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:41:13,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:41:13,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:41:13,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:41:13,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:41:13,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:41:13,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:41:13,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:41:13,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:41:13,476 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 [2024-11-07 01:41:13,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:41:13,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:41:13,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:41:13,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:41:13,687 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:41:13,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-11-07 01:41:14,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:41:15,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:41:15,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-11-07 01:41:15,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6af03a939/b87167e0d8d94e6480aca4f22edaa917/FLAG1a9ce72cf [2024-11-07 01:41:15,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6af03a939/b87167e0d8d94e6480aca4f22edaa917 [2024-11-07 01:41:15,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:41:15,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:41:15,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:41:15,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:41:15,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:41:15,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:15" (1/1) ... [2024-11-07 01:41:15,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314f120a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:15, skipping insertion in model container [2024-11-07 01:41:15,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:15" (1/1) ... [2024-11-07 01:41:15,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:41:15,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2024-11-07 01:41:15,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2024-11-07 01:41:16,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:41:16,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:41:16,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2024-11-07 01:41:16,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2024-11-07 01:41:16,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:41:16,691 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:41:16,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16 WrapperNode [2024-11-07 01:41:16,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:41:16,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:41:16,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:41:16,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:41:16,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:16,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,115 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-11-07 01:41:17,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:41:17,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:41:17,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:41:17,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:41:17,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,380 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]. [2024-11-07 01:41:17,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:41:17,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:41:17,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:41:17,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:41:17,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (1/1) ... [2024-11-07 01:41:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:41:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:41:17,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:41:17,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:41:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:41:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:41:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:41:17,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:41:17,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:41:17,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:41:21,659 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-07 01:41:21,660 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:41:21,688 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:41:21,689 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 01:41:21,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:21 BoogieIcfgContainer [2024-11-07 01:41:21,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:41:21,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:41:21,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:41:21,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:41:21,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:41:15" (1/3) ... [2024-11-07 01:41:21,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7569b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:21, skipping insertion in model container [2024-11-07 01:41:21,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:16" (2/3) ... [2024-11-07 01:41:21,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7569b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:21, skipping insertion in model container [2024-11-07 01:41:21,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:21" (3/3) ... [2024-11-07 01:41:21,696 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-11-07 01:41:21,707 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:41:21,707 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:41:21,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:41:21,765 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;@7e09545d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:41:21,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:41:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 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) [2024-11-07 01:41:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 01:41:21,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:21,778 INFO L215 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] [2024-11-07 01:41:21,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 514726933, now seen corresponding path program 1 times [2024-11-07 01:41:21,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282281914] [2024-11-07 01:41:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:22,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:22,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282281914] [2024-11-07 01:41:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282281914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:22,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:41:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688731182] [2024-11-07 01:41:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:22,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:22,100 INFO L87 Difference]: Start difference. First operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2024-11-07 01:41:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:24,964 INFO L93 Difference]: Finished difference Result 2584 states and 4970 transitions. [2024-11-07 01:41:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2024-11-07 01:41:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:24,982 INFO L225 Difference]: With dead ends: 2584 [2024-11-07 01:41:24,982 INFO L226 Difference]: Without dead ends: 1634 [2024-11-07 01:41:24,986 INFO L431 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 [2024-11-07 01:41:24,988 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1102 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:24,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 386 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:41:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-07 01:41:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-11-07 01:41:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.8419117647058822) internal successors, (3006), 1633 states have internal predecessors, (3006), 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) [2024-11-07 01:41:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 3006 transitions. [2024-11-07 01:41:25,068 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 3006 transitions. Word has length 24 [2024-11-07 01:41:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:25,068 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 3006 transitions. [2024-11-07 01:41:25,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2024-11-07 01:41:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 3006 transitions. [2024-11-07 01:41:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 01:41:25,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:25,069 INFO L215 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] [2024-11-07 01:41:25,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:41:25,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:25,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2101780621, now seen corresponding path program 1 times [2024-11-07 01:41:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268092203] [2024-11-07 01:41:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:25,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268092203] [2024-11-07 01:41:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268092203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:41:25,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514277806] [2024-11-07 01:41:25,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:25,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:41:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:41:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:41:25,279 INFO L87 Difference]: Start difference. First operand 1634 states and 3006 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-07 01:41:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:25,352 INFO L93 Difference]: Finished difference Result 1700 states and 3110 transitions. [2024-11-07 01:41:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:41:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2024-11-07 01:41:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:25,358 INFO L225 Difference]: With dead ends: 1700 [2024-11-07 01:41:25,359 INFO L226 Difference]: Without dead ends: 1634 [2024-11-07 01:41:25,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:41:25,361 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:25,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-07 01:41:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-11-07 01:41:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.8045343137254901) internal successors, (2945), 1633 states have internal predecessors, (2945), 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) [2024-11-07 01:41:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2945 transitions. [2024-11-07 01:41:25,394 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2945 transitions. Word has length 30 [2024-11-07 01:41:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:25,394 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2945 transitions. [2024-11-07 01:41:25,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-07 01:41:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2945 transitions. [2024-11-07 01:41:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 01:41:25,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:25,397 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:25,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:41:25,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:25,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1651582301, now seen corresponding path program 1 times [2024-11-07 01:41:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757532139] [2024-11-07 01:41:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:25,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:25,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757532139] [2024-11-07 01:41:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757532139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:25,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:25,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:25,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153195379] [2024-11-07 01:41:25,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:25,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:25,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:25,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:25,761 INFO L87 Difference]: Start difference. First operand 1634 states and 2945 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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) [2024-11-07 01:41:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:26,189 INFO L93 Difference]: Finished difference Result 2626 states and 4545 transitions. [2024-11-07 01:41:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:41:26,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 90 [2024-11-07 01:41:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:26,200 INFO L225 Difference]: With dead ends: 2626 [2024-11-07 01:41:26,201 INFO L226 Difference]: Without dead ends: 2564 [2024-11-07 01:41:26,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-07 01:41:26,206 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 13578 mSDsluCounter, 3975 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13578 SdHoareTripleChecker+Valid, 5575 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:26,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13578 Valid, 5575 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:41:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-07 01:41:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1694. [2024-11-07 01:41:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1692 states have (on average 1.797872340425532) internal successors, (3042), 1693 states have internal predecessors, (3042), 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) [2024-11-07 01:41:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 3042 transitions. [2024-11-07 01:41:26,248 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 3042 transitions. Word has length 90 [2024-11-07 01:41:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:26,251 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 3042 transitions. [2024-11-07 01:41:26,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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) [2024-11-07 01:41:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 3042 transitions. [2024-11-07 01:41:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 01:41:26,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:26,252 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:26,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:41:26,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:26,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash 551619955, now seen corresponding path program 1 times [2024-11-07 01:41:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939306317] [2024-11-07 01:41:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:26,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:26,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939306317] [2024-11-07 01:41:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939306317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186555560] [2024-11-07 01:41:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:26,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:26,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:26,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:26,394 INFO L87 Difference]: Start difference. First operand 1694 states and 3042 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2024-11-07 01:41:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:26,431 INFO L93 Difference]: Finished difference Result 1927 states and 3417 transitions. [2024-11-07 01:41:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:26,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 92 [2024-11-07 01:41:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:26,438 INFO L225 Difference]: With dead ends: 1927 [2024-11-07 01:41:26,438 INFO L226 Difference]: Without dead ends: 1805 [2024-11-07 01:41:26,439 INFO L431 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 [2024-11-07 01:41:26,440 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:26,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2024-11-07 01:41:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1801. [2024-11-07 01:41:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.7854363535297388) internal successors, (3212), 1800 states have internal predecessors, (3212), 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) [2024-11-07 01:41:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 3212 transitions. [2024-11-07 01:41:26,474 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 3212 transitions. Word has length 92 [2024-11-07 01:41:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 3212 transitions. [2024-11-07 01:41:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2024-11-07 01:41:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 3212 transitions. [2024-11-07 01:41:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 01:41:26,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:26,476 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:26,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:41:26,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 618113467, now seen corresponding path program 1 times [2024-11-07 01:41:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519258908] [2024-11-07 01:41:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519258908] [2024-11-07 01:41:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519258908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:26,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886653693] [2024-11-07 01:41:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:26,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:26,936 INFO L87 Difference]: Start difference. First operand 1801 states and 3212 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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) [2024-11-07 01:41:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:27,299 INFO L93 Difference]: Finished difference Result 2032 states and 3580 transitions. [2024-11-07 01:41:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:41:27,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 92 [2024-11-07 01:41:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:27,306 INFO L225 Difference]: With dead ends: 2032 [2024-11-07 01:41:27,307 INFO L226 Difference]: Without dead ends: 1803 [2024-11-07 01:41:27,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:41:27,308 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 7629 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7629 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:27,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7629 Valid, 2278 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:41:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-07 01:41:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2024-11-07 01:41:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.784324624791551) internal successors, (3210), 1800 states have internal predecessors, (3210), 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) [2024-11-07 01:41:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 3210 transitions. [2024-11-07 01:41:27,344 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 3210 transitions. Word has length 92 [2024-11-07 01:41:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:27,345 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 3210 transitions. [2024-11-07 01:41:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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) [2024-11-07 01:41:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 3210 transitions. [2024-11-07 01:41:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:41:27,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:27,347 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:27,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:41:27,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1566925479, now seen corresponding path program 1 times [2024-11-07 01:41:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019766648] [2024-11-07 01:41:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019766648] [2024-11-07 01:41:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019766648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:41:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963673308] [2024-11-07 01:41:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:27,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:41:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:27,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:41:27,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:41:27,642 INFO L87 Difference]: Start difference. First operand 1801 states and 3210 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2024-11-07 01:41:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:27,678 INFO L93 Difference]: Finished difference Result 1809 states and 3219 transitions. [2024-11-07 01:41:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:41:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2024-11-07 01:41:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:27,684 INFO L225 Difference]: With dead ends: 1809 [2024-11-07 01:41:27,685 INFO L226 Difference]: Without dead ends: 1807 [2024-11-07 01:41:27,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:41:27,686 INFO L432 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6403 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:27,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6403 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-07 01:41:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2024-11-07 01:41:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1805 states have (on average 1.7811634349030472) internal successors, (3215), 1806 states have internal predecessors, (3215), 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) [2024-11-07 01:41:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 3215 transitions. [2024-11-07 01:41:27,720 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 3215 transitions. Word has length 93 [2024-11-07 01:41:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:27,720 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 3215 transitions. [2024-11-07 01:41:27,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2024-11-07 01:41:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 3215 transitions. [2024-11-07 01:41:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:41:27,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:27,722 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:41:27,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:41:27,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:27,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1991781703, now seen corresponding path program 1 times [2024-11-07 01:41:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:27,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431614434] [2024-11-07 01:41:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:27,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:27,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431614434] [2024-11-07 01:41:27,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431614434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:27,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:27,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988491944] [2024-11-07 01:41:27,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:27,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:41:27,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:41:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:41:27,920 INFO L87 Difference]: Start difference. First operand 1807 states and 3215 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-07 01:41:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:32,316 INFO L93 Difference]: Finished difference Result 5564 states and 10105 transitions. [2024-11-07 01:41:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:41:32,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-07 01:41:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:32,329 INFO L225 Difference]: With dead ends: 5564 [2024-11-07 01:41:32,329 INFO L226 Difference]: Without dead ends: 4060 [2024-11-07 01:41:32,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:41:32,332 INFO L432 NwaCegarLoop]: 861 mSDtfsCounter, 2493 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4805 mSolverCounterSat, 1138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 5943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1138 IncrementalHoareTripleChecker+Valid, 4805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:32,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2493 Valid, 881 Invalid, 5943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1138 Valid, 4805 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-07 01:41:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2024-11-07 01:41:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 4060. [2024-11-07 01:41:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4058 states have (on average 1.4302612124199112) internal successors, (5804), 4059 states have internal predecessors, (5804), 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) [2024-11-07 01:41:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5804 transitions. [2024-11-07 01:41:32,415 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5804 transitions. Word has length 93 [2024-11-07 01:41:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:32,415 INFO L471 AbstractCegarLoop]: Abstraction has 4060 states and 5804 transitions. [2024-11-07 01:41:32,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-07 01:41:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5804 transitions. [2024-11-07 01:41:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:32,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:32,418 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:41:32,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:32,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -401487589, now seen corresponding path program 1 times [2024-11-07 01:41:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:32,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155963995] [2024-11-07 01:41:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155963995] [2024-11-07 01:41:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155963995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:32,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517548877] [2024-11-07 01:41:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:32,492 INFO L87 Difference]: Start difference. First operand 4060 states and 5804 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:32,524 INFO L93 Difference]: Finished difference Result 4514 states and 6516 transitions. [2024-11-07 01:41:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-07 01:41:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:32,536 INFO L225 Difference]: With dead ends: 4514 [2024-11-07 01:41:32,536 INFO L226 Difference]: Without dead ends: 4279 [2024-11-07 01:41:32,538 INFO L431 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 [2024-11-07 01:41:32,539 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:32,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2024-11-07 01:41:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4277. [2024-11-07 01:41:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4277 states, 4275 states have (on average 1.4364912280701754) internal successors, (6141), 4276 states have internal predecessors, (6141), 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) [2024-11-07 01:41:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 4277 states and 6141 transitions. [2024-11-07 01:41:32,603 INFO L78 Accepts]: Start accepts. Automaton has 4277 states and 6141 transitions. Word has length 94 [2024-11-07 01:41:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:32,603 INFO L471 AbstractCegarLoop]: Abstraction has 4277 states and 6141 transitions. [2024-11-07 01:41:32,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4277 states and 6141 transitions. [2024-11-07 01:41:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:32,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:32,604 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:32,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:41:32,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:32,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1540581915, now seen corresponding path program 1 times [2024-11-07 01:41:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:32,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451228004] [2024-11-07 01:41:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:32,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451228004] [2024-11-07 01:41:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451228004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:32,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:32,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447738598] [2024-11-07 01:41:32,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:32,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:32,666 INFO L87 Difference]: Start difference. First operand 4277 states and 6141 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:32,700 INFO L93 Difference]: Finished difference Result 5149 states and 7499 transitions. [2024-11-07 01:41:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:32,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-07 01:41:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:32,713 INFO L225 Difference]: With dead ends: 5149 [2024-11-07 01:41:32,713 INFO L226 Difference]: Without dead ends: 4697 [2024-11-07 01:41:32,715 INFO L431 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 [2024-11-07 01:41:32,716 INFO L432 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:32,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2024-11-07 01:41:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 4695. [2024-11-07 01:41:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4693 states have (on average 1.4453441295546559) internal successors, (6783), 4694 states have internal predecessors, (6783), 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) [2024-11-07 01:41:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 6783 transitions. [2024-11-07 01:41:32,792 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 6783 transitions. Word has length 94 [2024-11-07 01:41:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:32,792 INFO L471 AbstractCegarLoop]: Abstraction has 4695 states and 6783 transitions. [2024-11-07 01:41:32,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 6783 transitions. [2024-11-07 01:41:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:32,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:32,793 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:32,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:41:32,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:32,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1967352859, now seen corresponding path program 1 times [2024-11-07 01:41:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:32,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996702729] [2024-11-07 01:41:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:32,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:32,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996702729] [2024-11-07 01:41:32,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996702729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:32,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:32,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:32,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769087399] [2024-11-07 01:41:32,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:32,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:32,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:32,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:32,859 INFO L87 Difference]: Start difference. First operand 4695 states and 6783 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:32,899 INFO L93 Difference]: Finished difference Result 6371 states and 9369 transitions. [2024-11-07 01:41:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-07 01:41:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:32,910 INFO L225 Difference]: With dead ends: 6371 [2024-11-07 01:41:32,913 INFO L226 Difference]: Without dead ends: 5501 [2024-11-07 01:41:32,916 INFO L431 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 [2024-11-07 01:41:32,917 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:32,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5501 states. [2024-11-07 01:41:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5501 to 5499. [2024-11-07 01:41:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5499 states, 5497 states have (on average 1.4558850281971984) internal successors, (8003), 5498 states have internal predecessors, (8003), 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) [2024-11-07 01:41:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 8003 transitions. [2024-11-07 01:41:33,028 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 8003 transitions. Word has length 94 [2024-11-07 01:41:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 5499 states and 8003 transitions. [2024-11-07 01:41:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 8003 transitions. [2024-11-07 01:41:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:33,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:33,030 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:33,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:41:33,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:33,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1089352421, now seen corresponding path program 1 times [2024-11-07 01:41:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:33,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302943372] [2024-11-07 01:41:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302943372] [2024-11-07 01:41:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302943372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164911147] [2024-11-07 01:41:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:33,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:33,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:33,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:33,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:33,100 INFO L87 Difference]: Start difference. First operand 5499 states and 8003 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:33,206 INFO L93 Difference]: Finished difference Result 8719 states and 12917 transitions. [2024-11-07 01:41:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:33,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-07 01:41:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:33,222 INFO L225 Difference]: With dead ends: 8719 [2024-11-07 01:41:33,222 INFO L226 Difference]: Without dead ends: 7045 [2024-11-07 01:41:33,225 INFO L431 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 [2024-11-07 01:41:33,226 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:33,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7045 states. [2024-11-07 01:41:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7045 to 7043. [2024-11-07 01:41:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7043 states, 7041 states have (on average 1.4649907683567676) internal successors, (10315), 7042 states have internal predecessors, (10315), 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) [2024-11-07 01:41:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 10315 transitions. [2024-11-07 01:41:33,338 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 10315 transitions. Word has length 94 [2024-11-07 01:41:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:33,338 INFO L471 AbstractCegarLoop]: Abstraction has 7043 states and 10315 transitions. [2024-11-07 01:41:33,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 10315 transitions. [2024-11-07 01:41:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:33,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:33,339 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:33,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:41:33,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:33,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1523888357, now seen corresponding path program 1 times [2024-11-07 01:41:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627727426] [2024-11-07 01:41:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:33,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627727426] [2024-11-07 01:41:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627727426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:33,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330641678] [2024-11-07 01:41:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:33,406 INFO L87 Difference]: Start difference. First operand 7043 states and 10315 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:33,481 INFO L93 Difference]: Finished difference Result 13223 states and 19629 transitions. [2024-11-07 01:41:33,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:33,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-07 01:41:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:33,500 INFO L225 Difference]: With dead ends: 13223 [2024-11-07 01:41:33,500 INFO L226 Difference]: Without dead ends: 10005 [2024-11-07 01:41:33,506 INFO L431 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 [2024-11-07 01:41:33,507 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:33,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10005 states. [2024-11-07 01:41:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10005 to 10003. [2024-11-07 01:41:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10003 states, 10001 states have (on average 1.4681531846815319) internal successors, (14683), 10002 states have internal predecessors, (14683), 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) [2024-11-07 01:41:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 14683 transitions. [2024-11-07 01:41:33,676 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 14683 transitions. Word has length 94 [2024-11-07 01:41:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:33,676 INFO L471 AbstractCegarLoop]: Abstraction has 10003 states and 14683 transitions. [2024-11-07 01:41:33,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 14683 transitions. [2024-11-07 01:41:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:33,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:33,677 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:33,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:41:33,677 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:33,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash 990146075, now seen corresponding path program 1 times [2024-11-07 01:41:33,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:33,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518348189] [2024-11-07 01:41:33,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:33,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518348189] [2024-11-07 01:41:33,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518348189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:33,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:33,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611508497] [2024-11-07 01:41:33,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:33,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:33,739 INFO L87 Difference]: Start difference. First operand 10003 states and 14683 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:33,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:33,872 INFO L93 Difference]: Finished difference Result 21847 states and 32285 transitions. [2024-11-07 01:41:33,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:33,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-07 01:41:33,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:33,900 INFO L225 Difference]: With dead ends: 21847 [2024-11-07 01:41:33,900 INFO L226 Difference]: Without dead ends: 15669 [2024-11-07 01:41:33,910 INFO L431 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 [2024-11-07 01:41:33,911 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:33,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15669 states. [2024-11-07 01:41:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15669 to 15667. [2024-11-07 01:41:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15667 states, 15665 states have (on average 1.4623045004787742) internal successors, (22907), 15666 states have internal predecessors, (22907), 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) [2024-11-07 01:41:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15667 states to 15667 states and 22907 transitions. [2024-11-07 01:41:34,268 INFO L78 Accepts]: Start accepts. Automaton has 15667 states and 22907 transitions. Word has length 94 [2024-11-07 01:41:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:34,268 INFO L471 AbstractCegarLoop]: Abstraction has 15667 states and 22907 transitions. [2024-11-07 01:41:34,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 15667 states and 22907 transitions. [2024-11-07 01:41:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:34,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:34,270 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:41:34,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1703496475, now seen corresponding path program 1 times [2024-11-07 01:41:34,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:34,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470923376] [2024-11-07 01:41:34,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470923376] [2024-11-07 01:41:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470923376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:34,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:34,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663030788] [2024-11-07 01:41:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:34,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:34,336 INFO L87 Difference]: Start difference. First operand 15667 states and 22907 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:34,596 INFO L93 Difference]: Finished difference Result 38327 states and 56061 transitions. [2024-11-07 01:41:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:34,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-07 01:41:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:34,641 INFO L225 Difference]: With dead ends: 38327 [2024-11-07 01:41:34,642 INFO L226 Difference]: Without dead ends: 26485 [2024-11-07 01:41:34,660 INFO L431 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 [2024-11-07 01:41:34,661 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:34,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26485 states. [2024-11-07 01:41:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26485 to 26483. [2024-11-07 01:41:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26483 states, 26481 states have (on average 1.4474906536762207) internal successors, (38331), 26482 states have internal predecessors, (38331), 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) [2024-11-07 01:41:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26483 states to 26483 states and 38331 transitions. [2024-11-07 01:41:35,188 INFO L78 Accepts]: Start accepts. Automaton has 26483 states and 38331 transitions. Word has length 94 [2024-11-07 01:41:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:35,189 INFO L471 AbstractCegarLoop]: Abstraction has 26483 states and 38331 transitions. [2024-11-07 01:41:35,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2024-11-07 01:41:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 26483 states and 38331 transitions. [2024-11-07 01:41:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 01:41:35,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:35,190 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:41:35,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:41:35,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:35,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1836989324, now seen corresponding path program 1 times [2024-11-07 01:41:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290628381] [2024-11-07 01:41:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 01:41:35,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290628381] [2024-11-07 01:41:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290628381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:35,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:35,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:41:35,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171183264] [2024-11-07 01:41:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:35,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:35,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:35,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:35,257 INFO L87 Difference]: Start difference. First operand 26483 states and 38331 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:41:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:37,785 INFO L93 Difference]: Finished difference Result 30991 states and 45714 transitions. [2024-11-07 01:41:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-07 01:41:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:37,834 INFO L225 Difference]: With dead ends: 30991 [2024-11-07 01:41:37,834 INFO L226 Difference]: Without dead ends: 27985 [2024-11-07 01:41:37,841 INFO L431 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 [2024-11-07 01:41:37,842 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 892 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:37,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 641 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:41:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27985 states. [2024-11-07 01:41:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27985 to 27985. [2024-11-07 01:41:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27985 states, 27983 states have (on average 1.4384805060215131) internal successors, (40253), 27984 states have internal predecessors, (40253), 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) [2024-11-07 01:41:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27985 states to 27985 states and 40253 transitions. [2024-11-07 01:41:38,500 INFO L78 Accepts]: Start accepts. Automaton has 27985 states and 40253 transitions. Word has length 95 [2024-11-07 01:41:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:38,500 INFO L471 AbstractCegarLoop]: Abstraction has 27985 states and 40253 transitions. [2024-11-07 01:41:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:41:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27985 states and 40253 transitions. [2024-11-07 01:41:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 01:41:38,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:38,501 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:38,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:41:38,501 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1087415530, now seen corresponding path program 1 times [2024-11-07 01:41:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:38,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799288689] [2024-11-07 01:41:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799288689] [2024-11-07 01:41:38,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799288689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:38,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:38,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886334904] [2024-11-07 01:41:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:38,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:38,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:38,587 INFO L87 Difference]: Start difference. First operand 27985 states and 40253 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2024-11-07 01:41:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:38,956 INFO L93 Difference]: Finished difference Result 51544 states and 74819 transitions. [2024-11-07 01:41:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:38,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-07 01:41:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:39,016 INFO L225 Difference]: With dead ends: 51544 [2024-11-07 01:41:39,016 INFO L226 Difference]: Without dead ends: 38997 [2024-11-07 01:41:39,038 INFO L431 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 [2024-11-07 01:41:39,039 INFO L432 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:39,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38997 states. [2024-11-07 01:41:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38997 to 38995. [2024-11-07 01:41:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38995 states, 38993 states have (on average 1.4361295617162055) internal successors, (55999), 38994 states have internal predecessors, (55999), 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) [2024-11-07 01:41:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38995 states to 38995 states and 55999 transitions. [2024-11-07 01:41:39,802 INFO L78 Accepts]: Start accepts. Automaton has 38995 states and 55999 transitions. Word has length 96 [2024-11-07 01:41:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:39,803 INFO L471 AbstractCegarLoop]: Abstraction has 38995 states and 55999 transitions. [2024-11-07 01:41:39,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2024-11-07 01:41:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 38995 states and 55999 transitions. [2024-11-07 01:41:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:41:39,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:39,809 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:41:39,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:41:39,810 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:39,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 54573310, now seen corresponding path program 1 times [2024-11-07 01:41:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378645850] [2024-11-07 01:41:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:39,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:41:40,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:40,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378645850] [2024-11-07 01:41:40,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378645850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:40,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781369886] [2024-11-07 01:41:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:40,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:40,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:40,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:40,045 INFO L87 Difference]: Start difference. First operand 38995 states and 55999 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:41:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:43,793 INFO L93 Difference]: Finished difference Result 315109 states and 454600 transitions. [2024-11-07 01:41:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:41:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-07 01:41:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:44,328 INFO L225 Difference]: With dead ends: 315109 [2024-11-07 01:41:44,329 INFO L226 Difference]: Without dead ends: 281443 [2024-11-07 01:41:44,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:41:44,404 INFO L432 NwaCegarLoop]: 1706 mSDtfsCounter, 11840 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11840 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:44,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11840 Valid, 4973 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:41:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281443 states. [2024-11-07 01:41:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281443 to 72659. [2024-11-07 01:41:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72659 states, 72657 states have (on average 1.4348927150859518) internal successors, (104255), 72658 states have internal predecessors, (104255), 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) [2024-11-07 01:41:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72659 states to 72659 states and 104255 transitions. [2024-11-07 01:41:47,236 INFO L78 Accepts]: Start accepts. Automaton has 72659 states and 104255 transitions. Word has length 119 [2024-11-07 01:41:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:47,236 INFO L471 AbstractCegarLoop]: Abstraction has 72659 states and 104255 transitions. [2024-11-07 01:41:47,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:41:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 72659 states and 104255 transitions. [2024-11-07 01:41:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:41:47,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:47,244 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:41:47,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:41:47,244 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:47,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1996642814, now seen corresponding path program 1 times [2024-11-07 01:41:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:47,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106520449] [2024-11-07 01:41:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 01:41:47,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106520449] [2024-11-07 01:41:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106520449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848705968] [2024-11-07 01:41:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:47,438 INFO L87 Difference]: Start difference. First operand 72659 states and 104255 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-11-07 01:41:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:52,984 INFO L93 Difference]: Finished difference Result 348773 states and 502856 transitions. [2024-11-07 01:41:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:41:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 119 [2024-11-07 01:41:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:53,459 INFO L225 Difference]: With dead ends: 348773 [2024-11-07 01:41:53,459 INFO L226 Difference]: Without dead ends: 315107 [2024-11-07 01:41:53,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:41:53,551 INFO L432 NwaCegarLoop]: 1703 mSDtfsCounter, 11882 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11882 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:53,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11882 Valid, 4839 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:41:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315107 states. [2024-11-07 01:41:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315107 to 123219. [2024-11-07 01:41:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123219 states, 123217 states have (on average 1.430963259939781) internal successors, (176319), 123218 states have internal predecessors, (176319), 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) [2024-11-07 01:41:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123219 states to 123219 states and 176319 transitions. [2024-11-07 01:41:59,064 INFO L78 Accepts]: Start accepts. Automaton has 123219 states and 176319 transitions. Word has length 119 [2024-11-07 01:41:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:59,064 INFO L471 AbstractCegarLoop]: Abstraction has 123219 states and 176319 transitions. [2024-11-07 01:41:59,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-11-07 01:41:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 123219 states and 176319 transitions. [2024-11-07 01:41:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:41:59,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:59,071 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:41:59,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:41:59,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:59,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1871553538, now seen corresponding path program 1 times [2024-11-07 01:41:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970386830] [2024-11-07 01:41:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 01:41:59,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:59,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970386830] [2024-11-07 01:41:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970386830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:59,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:59,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273081931] [2024-11-07 01:41:59,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:59,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:59,262 INFO L87 Difference]: Start difference. First operand 123219 states and 176319 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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)