./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC --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 5cef1fa067bbb4b41514033d4724b62c75373060841bf986b96d67600e77c9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:20:10,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:20:10,108 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:20:10,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:20:10,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:20:10,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:20:10,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:20:10,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:20:10,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:20:10,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:20:10,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:20:10,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:20:10,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:20:10,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:20:10,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:20:10,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:20:10,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:20:10,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:20:10,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:20:10,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:20:10,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:20:10,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:20:10,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:20:10,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:20:10,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:20:10,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:20:10,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:20:10,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:20:10,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:20:10,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:20:10,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:20:10,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:20:10,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:20:10,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:20:10,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:20:10,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:20:10,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:20:10,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:20:10,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:20:10,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:20:10,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:20:10,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:20:10,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:20:10,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:20:10,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:20:10,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:20:10,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:20:10,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:20:10,146 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC 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 -> 5cef1fa067bbb4b41514033d4724b62c75373060841bf986b96d67600e77c9e6 [2024-11-24 00:20:10,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:20:10,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:20:10,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:20:10,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:20:10,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:20:10,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c [2024-11-24 00:20:13,720 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/data/6e139b077/d17f14a2850445f9b661e0a64bbce7f8/FLAG9643c517a [2024-11-24 00:20:14,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:20:14,471 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c [2024-11-24 00:20:14,521 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/data/6e139b077/d17f14a2850445f9b661e0a64bbce7f8/FLAG9643c517a [2024-11-24 00:20:14,547 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/data/6e139b077/d17f14a2850445f9b661e0a64bbce7f8 [2024-11-24 00:20:14,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:20:14,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:20:14,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:20:14,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:20:14,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:20:14,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:20:14" (1/1) ... [2024-11-24 00:20:14,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356c8c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:14, skipping insertion in model container [2024-11-24 00:20:14,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:20:14" (1/1) ... [2024-11-24 00:20:14,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:20:15,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[26897,26910] [2024-11-24 00:20:15,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[32452,32465] [2024-11-24 00:20:16,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:20:16,092 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:20:16,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[26897,26910] [2024-11-24 00:20:16,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c[32452,32465] [2024-11-24 00:20:16,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:20:16,712 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:20:16,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16 WrapperNode [2024-11-24 00:20:16,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:20:16,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:20:16,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:20:16,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:20:16,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:16,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,270 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5292 [2024-11-24 00:20:17,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:20:17,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:20:17,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:20:17,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:20:17,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,730 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-24 00:20:17,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:17,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:18,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:20:18,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:20:18,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:20:18,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:20:18,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (1/1) ... [2024-11-24 00:20:18,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:20:18,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:20:18,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:20:18,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f035686-fa80-461a-951f-ef416eb37d90/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:20:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:20:18,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:20:18,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:20:18,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:20:18,268 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:20:18,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:20:24,677 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-24 00:20:24,678 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:20:24,715 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:20:24,715 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-24 00:20:24,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:20:24 BoogieIcfgContainer [2024-11-24 00:20:24,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:20:24,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:20:24,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:20:24,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:20:24,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:20:14" (1/3) ... [2024-11-24 00:20:24,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394c210e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:20:24, skipping insertion in model container [2024-11-24 00:20:24,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:20:16" (2/3) ... [2024-11-24 00:20:24,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394c210e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:20:24, skipping insertion in model container [2024-11-24 00:20:24,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:20:24" (3/3) ... [2024-11-24 00:20:24,736 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c [2024-11-24 00:20:24,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:20:24,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label01.c that has 1 procedures, 948 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-24 00:20:24,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:20:24,867 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;@81dc48b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:20:24,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-24 00:20:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 948 states, 945 states have (on average 1.9026455026455027) internal successors, (1798), 947 states have internal predecessors, (1798), 0 states have call successors, (0), 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-24 00:20:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-24 00:20:24,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:24,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:20:24,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:24,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash 607462501, now seen corresponding path program 1 times [2024-11-24 00:20:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960611636] [2024-11-24 00:20:24,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:25,314 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-24 00:20:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960611636] [2024-11-24 00:20:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960611636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:25,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:20:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941162087] [2024-11-24 00:20:25,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:25,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:20:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:25,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:20:25,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:20:25,352 INFO L87 Difference]: Start difference. First operand has 948 states, 945 states have (on average 1.9026455026455027) internal successors, (1798), 947 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-24 00:20:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:25,470 INFO L93 Difference]: Finished difference Result 1829 states and 3466 transitions. [2024-11-24 00:20:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:20:25,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-24 00:20:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:25,494 INFO L225 Difference]: With dead ends: 1829 [2024-11-24 00:20:25,498 INFO L226 Difference]: Without dead ends: 882 [2024-11-24 00:20:25,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:20:25,513 INFO L435 NwaCegarLoop]: 1732 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:25,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-24 00:20:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-11-24 00:20:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.8920454545454546) internal successors, (1665), 881 states have internal predecessors, (1665), 0 states have call successors, (0), 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-24 00:20:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1665 transitions. [2024-11-24 00:20:25,624 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1665 transitions. Word has length 31 [2024-11-24 00:20:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:25,626 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1665 transitions. [2024-11-24 00:20:25,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-24 00:20:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1665 transitions. [2024-11-24 00:20:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-24 00:20:25,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:25,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:20:25,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:20:25,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:25,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:25,631 INFO L85 PathProgramCache]: Analyzing trace with hash 748011111, now seen corresponding path program 1 times [2024-11-24 00:20:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:25,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082913372] [2024-11-24 00:20:25,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:25,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:26,092 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-24 00:20:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082913372] [2024-11-24 00:20:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082913372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:26,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:26,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:20:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233181381] [2024-11-24 00:20:26,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:26,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:20:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:26,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:20:26,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:20:26,096 INFO L87 Difference]: Start difference. First operand 882 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-24 00:20:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:26,333 INFO L93 Difference]: Finished difference Result 947 states and 1767 transitions. [2024-11-24 00:20:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:20:26,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-24 00:20:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:26,342 INFO L225 Difference]: With dead ends: 947 [2024-11-24 00:20:26,342 INFO L226 Difference]: Without dead ends: 882 [2024-11-24 00:20:26,343 INFO L434 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-24 00:20:26,344 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 4923 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6586 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.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:26,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6586 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:20:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-24 00:20:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-11-24 00:20:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.8227272727272728) internal successors, (1604), 881 states have internal predecessors, (1604), 0 states have call successors, (0), 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-24 00:20:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1604 transitions. [2024-11-24 00:20:26,381 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1604 transitions. Word has length 31 [2024-11-24 00:20:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:26,381 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1604 transitions. [2024-11-24 00:20:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-24 00:20:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1604 transitions. [2024-11-24 00:20:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-24 00:20:26,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:26,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:20:26,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:20:26,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:26,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1953133621, now seen corresponding path program 1 times [2024-11-24 00:20:26,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:26,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140949894] [2024-11-24 00:20:26,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:26,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:26,525 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-24 00:20:26,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:26,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140949894] [2024-11-24 00:20:26,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140949894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:26,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:26,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:20:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095308101] [2024-11-24 00:20:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:26,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:26,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:26,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:26,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:26,527 INFO L87 Difference]: Start difference. First operand 882 states and 1604 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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-24 00:20:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:31,212 INFO L93 Difference]: Finished difference Result 2386 states and 4477 transitions. [2024-11-24 00:20:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:31,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-24 00:20:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:31,222 INFO L225 Difference]: With dead ends: 2386 [2024-11-24 00:20:31,222 INFO L226 Difference]: Without dead ends: 1633 [2024-11-24 00:20:31,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:31,227 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 932 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:31,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 242 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-24 00:20:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-24 00:20:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2024-11-24 00:20:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1631 states have (on average 1.8264868179031268) internal successors, (2979), 1632 states have internal predecessors, (2979), 0 states have call successors, (0), 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-24 00:20:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2979 transitions. [2024-11-24 00:20:31,302 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2979 transitions. Word has length 48 [2024-11-24 00:20:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:31,302 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2979 transitions. [2024-11-24 00:20:31,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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-24 00:20:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2979 transitions. [2024-11-24 00:20:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-24 00:20:31,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:31,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:31,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:20:31,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1819257143, now seen corresponding path program 1 times [2024-11-24 00:20:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:31,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298348347] [2024-11-24 00:20:31,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:31,962 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-24 00:20:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298348347] [2024-11-24 00:20:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298348347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:31,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:31,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:20:31,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453887440] [2024-11-24 00:20:31,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:31,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:20:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:20:31,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:20:31,966 INFO L87 Difference]: Start difference. First operand 1633 states and 2979 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 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-24 00:20:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:32,754 INFO L93 Difference]: Finished difference Result 2609 states and 4547 transitions. [2024-11-24 00:20:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 00:20:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-24 00:20:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:32,765 INFO L225 Difference]: With dead ends: 2609 [2024-11-24 00:20:32,766 INFO L226 Difference]: Without dead ends: 2548 [2024-11-24 00:20:32,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-24 00:20:32,768 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 13470 mSDsluCounter, 4611 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13470 SdHoareTripleChecker+Valid, 6211 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:32,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13470 Valid, 6211 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 00:20:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-24 00:20:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 1692. [2024-11-24 00:20:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 1.8189349112426036) internal successors, (3074), 1691 states have internal predecessors, (3074), 0 states have call successors, (0), 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-24 00:20:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 3074 transitions. [2024-11-24 00:20:32,839 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 3074 transitions. Word has length 91 [2024-11-24 00:20:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:32,840 INFO L471 AbstractCegarLoop]: Abstraction has 1692 states and 3074 transitions. [2024-11-24 00:20:32,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 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-24 00:20:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 3074 transitions. [2024-11-24 00:20:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-24 00:20:32,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:32,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:32,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:20:32,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:32,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1161263545, now seen corresponding path program 1 times [2024-11-24 00:20:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681929609] [2024-11-24 00:20:32,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20: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-24 00:20:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681929609] [2024-11-24 00:20:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681929609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686219782] [2024-11-24 00:20:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:33,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:33,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:33,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:33,104 INFO L87 Difference]: Start difference. First operand 1692 states and 3074 transitions. Second operand has 3 states, 3 states have (on average 31.0) 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-24 00:20:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:33,157 INFO L93 Difference]: Finished difference Result 1921 states and 3441 transitions. [2024-11-24 00:20:33,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:33,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) 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-24 00:20:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:33,166 INFO L225 Difference]: With dead ends: 1921 [2024-11-24 00:20:33,166 INFO L226 Difference]: Without dead ends: 1801 [2024-11-24 00:20:33,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:33,169 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1506 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:33,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1695 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-24 00:20:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1799. [2024-11-24 00:20:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.805230940456316) internal successors, (3244), 1798 states have internal predecessors, (3244), 0 states have call successors, (0), 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-24 00:20:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 3244 transitions. [2024-11-24 00:20:33,231 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 3244 transitions. Word has length 93 [2024-11-24 00:20:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:33,232 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 3244 transitions. [2024-11-24 00:20:33,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) 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-24 00:20:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 3244 transitions. [2024-11-24 00:20:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-24 00:20:33,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:33,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:33,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:20:33,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:33,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1094770033, now seen corresponding path program 1 times [2024-11-24 00:20:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220143028] [2024-11-24 00:20:33,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:34,123 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-24 00:20:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220143028] [2024-11-24 00:20:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220143028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:20:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375610641] [2024-11-24 00:20:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:34,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:20:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:34,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:20:34,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:20:34,125 INFO L87 Difference]: Start difference. First operand 1799 states and 3244 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-24 00:20:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:34,806 INFO L93 Difference]: Finished difference Result 2028 states and 3608 transitions. [2024-11-24 00:20:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:20:34,807 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-24 00:20:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:34,820 INFO L225 Difference]: With dead ends: 2028 [2024-11-24 00:20:34,820 INFO L226 Difference]: Without dead ends: 1801 [2024-11-24 00:20:34,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:20:34,826 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 12132 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12132 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:34,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12132 Valid, 2262 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:20:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-24 00:20:34,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1799. [2024-11-24 00:20:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.8041179744017808) internal successors, (3242), 1798 states have internal predecessors, (3242), 0 states have call successors, (0), 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-24 00:20:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 3242 transitions. [2024-11-24 00:20:34,888 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 3242 transitions. Word has length 93 [2024-11-24 00:20:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:34,890 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 3242 transitions. [2024-11-24 00:20:34,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-24 00:20:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 3242 transitions. [2024-11-24 00:20:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:20:34,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:34,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:34,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:20:34,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:34,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 7144525, now seen corresponding path program 1 times [2024-11-24 00:20:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:34,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16304995] [2024-11-24 00:20:34,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:35,382 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-24 00:20:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16304995] [2024-11-24 00:20:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16304995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:35,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:20:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53767827] [2024-11-24 00:20:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:35,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:20:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:35,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:20:35,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:20:35,384 INFO L87 Difference]: Start difference. First operand 1799 states and 3242 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-24 00:20:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:35,443 INFO L93 Difference]: Finished difference Result 1807 states and 3251 transitions. [2024-11-24 00:20:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:20:35,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-24 00:20:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:35,451 INFO L225 Difference]: With dead ends: 1807 [2024-11-24 00:20:35,451 INFO L226 Difference]: Without dead ends: 1805 [2024-11-24 00:20:35,453 INFO L434 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-24 00:20:35,453 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 0 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6395 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-24 00:20:35,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6395 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2024-11-24 00:20:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2024-11-24 00:20:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1803 states have (on average 1.8008874098724348) internal successors, (3247), 1804 states have internal predecessors, (3247), 0 states have call successors, (0), 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-24 00:20:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 3247 transitions. [2024-11-24 00:20:35,509 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 3247 transitions. Word has length 94 [2024-11-24 00:20:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:35,510 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 3247 transitions. [2024-11-24 00:20:35,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-24 00:20:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 3247 transitions. [2024-11-24 00:20:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:35,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:35,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:35,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:20:35,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:35,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 471923503, now seen corresponding path program 1 times [2024-11-24 00:20:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:35,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054350901] [2024-11-24 00:20:35,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:35,665 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-24 00:20:35,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:35,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054350901] [2024-11-24 00:20:35,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054350901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:35,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:35,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:35,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188218049] [2024-11-24 00:20:35,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:35,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:35,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:35,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:35,667 INFO L87 Difference]: Start difference. First operand 1805 states and 3247 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:35,721 INFO L93 Difference]: Finished difference Result 2052 states and 3633 transitions. [2024-11-24 00:20:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:35,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:35,730 INFO L225 Difference]: With dead ends: 2052 [2024-11-24 00:20:35,730 INFO L226 Difference]: Without dead ends: 1926 [2024-11-24 00:20:35,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:35,732 INFO L435 NwaCegarLoop]: 1686 mSDtfsCounter, 1526 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1785 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-24 00:20:35,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2024-11-24 00:20:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2024-11-24 00:20:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1922 states have (on average 1.7851196670135276) internal successors, (3431), 1923 states have internal predecessors, (3431), 0 states have call successors, (0), 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-24 00:20:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3431 transitions. [2024-11-24 00:20:35,797 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3431 transitions. Word has length 95 [2024-11-24 00:20:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:35,797 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3431 transitions. [2024-11-24 00:20:35,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3431 transitions. [2024-11-24 00:20:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:35,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:35,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:35,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:20:35,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:35,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:35,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1510056913, now seen corresponding path program 1 times [2024-11-24 00:20:35,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:35,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382176436] [2024-11-24 00:20:35,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:35,959 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-24 00:20:35,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:35,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382176436] [2024-11-24 00:20:35,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382176436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:35,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068820866] [2024-11-24 00:20:35,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:35,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:35,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:35,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:35,964 INFO L87 Difference]: Start difference. First operand 1924 states and 3431 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:36,023 INFO L93 Difference]: Finished difference Result 2598 states and 4483 transitions. [2024-11-24 00:20:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:36,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:36,032 INFO L225 Difference]: With dead ends: 2598 [2024-11-24 00:20:36,033 INFO L226 Difference]: Without dead ends: 2249 [2024-11-24 00:20:36,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:36,036 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1524 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1791 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-24 00:20:36,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2024-11-24 00:20:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2024-11-24 00:20:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 2245 states have (on average 1.7501113585746102) internal successors, (3929), 2246 states have internal predecessors, (3929), 0 states have call successors, (0), 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-24 00:20:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3929 transitions. [2024-11-24 00:20:36,115 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3929 transitions. Word has length 95 [2024-11-24 00:20:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:36,115 INFO L471 AbstractCegarLoop]: Abstraction has 2247 states and 3929 transitions. [2024-11-24 00:20:36,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3929 transitions. [2024-11-24 00:20:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:36,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:36,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:36,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:20:36,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:36,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash 594927151, now seen corresponding path program 1 times [2024-11-24 00:20:36,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:36,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844934451] [2024-11-24 00:20:36,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:36,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:36,268 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-24 00:20:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844934451] [2024-11-24 00:20:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844934451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910000042] [2024-11-24 00:20:36,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:36,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:36,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:36,269 INFO L87 Difference]: Start difference. First operand 2247 states and 3929 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:36,339 INFO L93 Difference]: Finished difference Result 3543 states and 5935 transitions. [2024-11-24 00:20:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:36,351 INFO L225 Difference]: With dead ends: 3543 [2024-11-24 00:20:36,351 INFO L226 Difference]: Without dead ends: 2871 [2024-11-24 00:20:36,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:36,354 INFO L435 NwaCegarLoop]: 1676 mSDtfsCounter, 1520 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1787 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-24 00:20:36,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2024-11-24 00:20:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2869. [2024-11-24 00:20:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2867 states have (on average 1.7010812696198117) internal successors, (4877), 2868 states have internal predecessors, (4877), 0 states have call successors, (0), 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-24 00:20:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4877 transitions. [2024-11-24 00:20:36,460 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4877 transitions. Word has length 95 [2024-11-24 00:20:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:36,461 INFO L471 AbstractCegarLoop]: Abstraction has 2869 states and 4877 transitions. [2024-11-24 00:20:36,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4877 transitions. [2024-11-24 00:20:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:36,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:36,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:36,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:20:36,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:36,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:36,463 INFO L85 PathProgramCache]: Analyzing trace with hash 858783535, now seen corresponding path program 1 times [2024-11-24 00:20:36,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:36,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123802448] [2024-11-24 00:20:36,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:36,599 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-24 00:20:36,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123802448] [2024-11-24 00:20:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123802448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:36,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:36,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413140172] [2024-11-24 00:20:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:36,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:36,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:36,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:36,601 INFO L87 Difference]: Start difference. First operand 2869 states and 4877 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:36,782 INFO L93 Difference]: Finished difference Result 5361 states and 8695 transitions. [2024-11-24 00:20:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:36,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:36,805 INFO L225 Difference]: With dead ends: 5361 [2024-11-24 00:20:36,805 INFO L226 Difference]: Without dead ends: 4067 [2024-11-24 00:20:36,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:36,807 INFO L435 NwaCegarLoop]: 1674 mSDtfsCounter, 1518 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 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-24 00:20:36,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2024-11-24 00:20:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 4065. [2024-11-24 00:20:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4065 states, 4063 states have (on average 1.6433669702190499) internal successors, (6677), 4064 states have internal predecessors, (6677), 0 states have call successors, (0), 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-24 00:20:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 6677 transitions. [2024-11-24 00:20:36,927 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 6677 transitions. Word has length 95 [2024-11-24 00:20:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:36,927 INFO L471 AbstractCegarLoop]: Abstraction has 4065 states and 6677 transitions. [2024-11-24 00:20:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 6677 transitions. [2024-11-24 00:20:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:36,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:36,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:20:36,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -118423249, now seen corresponding path program 1 times [2024-11-24 00:20:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993050156] [2024-11-24 00:20:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:37,037 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-24 00:20:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:37,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993050156] [2024-11-24 00:20:37,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993050156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:37,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:37,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629150058] [2024-11-24 00:20:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:37,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:37,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:37,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:37,039 INFO L87 Difference]: Start difference. First operand 4065 states and 6677 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:37,141 INFO L93 Difference]: Finished difference Result 8853 states and 13927 transitions. [2024-11-24 00:20:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:37,163 INFO L225 Difference]: With dead ends: 8853 [2024-11-24 00:20:37,163 INFO L226 Difference]: Without dead ends: 6363 [2024-11-24 00:20:37,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:37,168 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 1514 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1785 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-24 00:20:37,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6363 states. [2024-11-24 00:20:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6363 to 6361. [2024-11-24 00:20:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6361 states, 6359 states have (on average 1.5859411857210253) internal successors, (10085), 6360 states have internal predecessors, (10085), 0 states have call successors, (0), 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-24 00:20:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 10085 transitions. [2024-11-24 00:20:37,384 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 10085 transitions. Word has length 95 [2024-11-24 00:20:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:37,384 INFO L471 AbstractCegarLoop]: Abstraction has 6361 states and 10085 transitions. [2024-11-24 00:20:37,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 10085 transitions. [2024-11-24 00:20:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:37,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:37,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:37,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 00:20:37,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:37,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1662509615, now seen corresponding path program 1 times [2024-11-24 00:20:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:37,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078279082] [2024-11-24 00:20:37,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:37,573 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-24 00:20:37,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:37,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078279082] [2024-11-24 00:20:37,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078279082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:37,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042976439] [2024-11-24 00:20:37,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:37,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:37,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:37,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:37,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:37,575 INFO L87 Difference]: Start difference. First operand 6361 states and 10085 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:37,752 INFO L93 Difference]: Finished difference Result 15549 states and 23815 transitions. [2024-11-24 00:20:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:37,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:37,779 INFO L225 Difference]: With dead ends: 15549 [2024-11-24 00:20:37,780 INFO L226 Difference]: Without dead ends: 10763 [2024-11-24 00:20:37,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:37,787 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 1512 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1787 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-24 00:20:37,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2024-11-24 00:20:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2024-11-24 00:20:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10759 states have (on average 1.5351798494283855) internal successors, (16517), 10760 states have internal predecessors, (16517), 0 states have call successors, (0), 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-24 00:20:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 16517 transitions. [2024-11-24 00:20:38,095 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 16517 transitions. Word has length 95 [2024-11-24 00:20:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:38,095 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 16517 transitions. [2024-11-24 00:20:38,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 16517 transitions. [2024-11-24 00:20:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:38,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:38,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:38,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 00:20:38,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:38,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:38,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2097045551, now seen corresponding path program 1 times [2024-11-24 00:20:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388969714] [2024-11-24 00:20:38,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:38,210 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-24 00:20:38,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:38,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388969714] [2024-11-24 00:20:38,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388969714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:38,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:38,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670340383] [2024-11-24 00:20:38,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:38,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:38,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:38,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:38,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:38,211 INFO L87 Difference]: Start difference. First operand 10761 states and 16517 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:38,509 INFO L93 Difference]: Finished difference Result 28365 states and 42439 transitions. [2024-11-24 00:20:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:38,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:38,556 INFO L225 Difference]: With dead ends: 28365 [2024-11-24 00:20:38,556 INFO L226 Difference]: Without dead ends: 19179 [2024-11-24 00:20:38,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:38,570 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 1516 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1791 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-24 00:20:38,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19179 states. [2024-11-24 00:20:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19179 to 19177. [2024-11-24 00:20:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19177 states, 19175 states have (on average 1.4922033898305085) internal successors, (28613), 19176 states have internal predecessors, (28613), 0 states have call successors, (0), 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-24 00:20:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19177 states to 19177 states and 28613 transitions. [2024-11-24 00:20:39,130 INFO L78 Accepts]: Start accepts. Automaton has 19177 states and 28613 transitions. Word has length 95 [2024-11-24 00:20:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 19177 states and 28613 transitions. [2024-11-24 00:20:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19177 states and 28613 transitions. [2024-11-24 00:20:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-24 00:20:39,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:39,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:20:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 00:20:39,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:39,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash 432012591, now seen corresponding path program 1 times [2024-11-24 00:20:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327367392] [2024-11-24 00:20:39,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:39,245 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-24 00:20:39,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:39,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327367392] [2024-11-24 00:20:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327367392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:20:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942765257] [2024-11-24 00:20:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:20:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:39,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:20:39,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:39,247 INFO L87 Difference]: Start difference. First operand 19177 states and 28613 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:39,920 INFO L93 Difference]: Finished difference Result 52845 states and 77383 transitions. [2024-11-24 00:20:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:20:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:40,003 INFO L225 Difference]: With dead ends: 52845 [2024-11-24 00:20:40,003 INFO L226 Difference]: Without dead ends: 35243 [2024-11-24 00:20:40,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:20:40,027 INFO L435 NwaCegarLoop]: 1686 mSDtfsCounter, 1522 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1793 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-24 00:20:40,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1793 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:20:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35243 states. [2024-11-24 00:20:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35243 to 35241. [2024-11-24 00:20:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35241 states, 35239 states have (on average 1.4548937257016374) internal successors, (51269), 35240 states have internal predecessors, (51269), 0 states have call successors, (0), 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-24 00:20:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35241 states to 35241 states and 51269 transitions. [2024-11-24 00:20:40,964 INFO L78 Accepts]: Start accepts. Automaton has 35241 states and 51269 transitions. Word has length 95 [2024-11-24 00:20:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 35241 states and 51269 transitions. [2024-11-24 00:20:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 00:20:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 35241 states and 51269 transitions. [2024-11-24 00:20:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:20:40,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:40,974 INFO L218 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, 1, 1, 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-24 00:20:40,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 00:20:40,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:40,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1265201594, now seen corresponding path program 1 times [2024-11-24 00:20:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:40,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349111438] [2024-11-24 00:20:40,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 00:20:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349111438] [2024-11-24 00:20:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349111438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:20:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903487596] [2024-11-24 00:20:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:41,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:20:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:41,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:20:41,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:20:41,369 INFO L87 Difference]: Start difference. First operand 35241 states and 51269 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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-24 00:20:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:46,281 INFO L93 Difference]: Finished difference Result 301243 states and 433358 transitions. [2024-11-24 00:20:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:20:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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 121 [2024-11-24 00:20:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:46,950 INFO L225 Difference]: With dead ends: 301243 [2024-11-24 00:20:46,950 INFO L226 Difference]: Without dead ends: 277689 [2024-11-24 00:20:47,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-24 00:20:47,011 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 11804 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11804 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:47,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11804 Valid, 5134 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:20:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277689 states. [2024-11-24 00:20:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277689 to 63913. [2024-11-24 00:20:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63913 states, 63911 states have (on average 1.4410821298368044) internal successors, (92101), 63912 states have internal predecessors, (92101), 0 states have call successors, (0), 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-24 00:20:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63913 states to 63913 states and 92101 transitions. [2024-11-24 00:20:50,484 INFO L78 Accepts]: Start accepts. Automaton has 63913 states and 92101 transitions. Word has length 121 [2024-11-24 00:20:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:20:50,486 INFO L471 AbstractCegarLoop]: Abstraction has 63913 states and 92101 transitions. [2024-11-24 00:20:50,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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-24 00:20:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 63913 states and 92101 transitions. [2024-11-24 00:20:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:20:50,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:20:50,497 INFO L218 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, 1, 1, 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-24 00:20:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 00:20:50,497 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:20:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:20:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1047785286, now seen corresponding path program 1 times [2024-11-24 00:20:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:20:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422747064] [2024-11-24 00:20:50,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:20:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:20:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:20:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-24 00:20:50,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:20:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422747064] [2024-11-24 00:20:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422747064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:20:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:20:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:20:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535589733] [2024-11-24 00:20:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:20:50,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:20:50,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:20:50,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:20:50,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:20:50,848 INFO L87 Difference]: Start difference. First operand 63913 states and 92101 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 00:20:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:20:56,952 INFO L93 Difference]: Finished difference Result 334907 states and 481486 transitions. [2024-11-24 00:20:56,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:20:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 121 [2024-11-24 00:20:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:20:57,393 INFO L225 Difference]: With dead ends: 334907 [2024-11-24 00:20:57,394 INFO L226 Difference]: Without dead ends: 301241 [2024-11-24 00:20:57,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-24 00:20:57,452 INFO L435 NwaCegarLoop]: 1700 mSDtfsCounter, 11804 mSDsluCounter, 3406 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11804 SdHoareTripleChecker+Valid, 5106 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:20:57,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11804 Valid, 5106 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:20:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301241 states. [2024-11-24 00:21:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301241 to 109353. [2024-11-24 00:21:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109353 states, 109351 states have (on average 1.4333750948779618) internal successors, (156741), 109352 states have internal predecessors, (156741), 0 states have call successors, (0), 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-24 00:21:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109353 states to 109353 states and 156741 transitions. [2024-11-24 00:21:02,037 INFO L78 Accepts]: Start accepts. Automaton has 109353 states and 156741 transitions. Word has length 121 [2024-11-24 00:21:02,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:21:02,037 INFO L471 AbstractCegarLoop]: Abstraction has 109353 states and 156741 transitions. [2024-11-24 00:21:02,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-24 00:21:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 109353 states and 156741 transitions. [2024-11-24 00:21:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:21:02,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:21:02,048 INFO L218 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, 1, 1, 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-24 00:21:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 00:21:02,048 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:21:02,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:21:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1142197946, now seen corresponding path program 1 times [2024-11-24 00:21:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:21:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416514942] [2024-11-24 00:21:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:21:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:21:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:21:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-24 00:21:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:21:02,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416514942] [2024-11-24 00:21:02,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416514942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:21:02,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:21:02,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:21:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132604287] [2024-11-24 00:21:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:21:02,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:21:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:21:02,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:21:02,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:21:02,620 INFO L87 Difference]: Start difference. First operand 109353 states and 156741 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)