./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:10:57,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:10:58,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:10:58,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:10:58,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:10:58,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:10:58,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:10:58,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:10:58,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:10:58,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:10:58,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:10:58,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:10:58,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:10:58,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:10:58,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:10:58,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:10:58,046 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2025-03-04 03:10:58,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:10:58,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:10:58,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:10:58,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:10:58,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:10:58,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-04 03:10:59,348 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f53fce7/25936a88e8634a48979581eec43ff714/FLAG0cf0f1d37 [2025-03-04 03:10:59,698 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:10:59,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-04 03:10:59,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f53fce7/25936a88e8634a48979581eec43ff714/FLAG0cf0f1d37 [2025-03-04 03:10:59,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f53fce7/25936a88e8634a48979581eec43ff714 [2025-03-04 03:10:59,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:10:59,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:10:59,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:10:59,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:10:59,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:10:59,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:10:59" (1/1) ... [2025-03-04 03:10:59,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dfe4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:10:59, skipping insertion in model container [2025-03-04 03:10:59,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:10:59" (1/1) ... [2025-03-04 03:10:59,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:11:00,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-03-04 03:11:00,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:11:00,458 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:11:00,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-03-04 03:11:00,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:11:00,607 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:11:00,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00 WrapperNode [2025-03-04 03:11:00,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:11:00,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:11:00,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:11:00,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:11:00,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,669 INFO L138 Inliner]: procedures = 78, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 1011 [2025-03-04 03:11:00,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:11:00,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:11:00,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:11:00,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:11:00,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,756 INFO L175 MemorySlicer]: Split 160 memory accesses to 6 slices as follows [2, 6, 42, 8, 20, 82]. 51 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 6, 0, 8, 1, 6]. The 103 writes are split as follows [0, 0, 42, 0, 19, 42]. [2025-03-04 03:11:00,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:11:00,807 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:11:00,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:11:00,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:11:00,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (1/1) ... [2025-03-04 03:11:00,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:11:00,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:11:00,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:11:00,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:11:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2025-03-04 03:11:00,852 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2025-03-04 03:11:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:11:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 03:11:00,852 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 03:11:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:11:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:11:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:11:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-03-04 03:11:00,853 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-03-04 03:11:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2025-03-04 03:11:00,854 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-04 03:11:00,854 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-04 03:11:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:11:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-03-04 03:11:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:11:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:11:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:11:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:11:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:11:00,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:11:01,054 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:11:01,056 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:11:01,097 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4257: havoc usb_register_driver_#t~nondet120#1; [2025-03-04 03:11:01,104 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc #t~ret114.base, #t~ret114.offset; [2025-03-04 03:11:01,172 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4204: havoc #t~malloc112.base, #t~malloc112.offset; [2025-03-04 03:11:01,178 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4214: havoc #t~nondet115; [2025-03-04 03:11:01,187 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4243: havoc #t~nondet118; [2025-03-04 03:11:01,211 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4207: havoc __kmalloc_#t~ret113#1.base, __kmalloc_#t~ret113#1.offset; [2025-03-04 03:11:01,212 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-03-04 03:11:01,217 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4239: havoc #t~ret117.base, #t~ret117.offset; [2025-03-04 03:11:05,870 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc strlcat_#t~nondet119#1; [2025-03-04 03:11:05,870 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3513: havoc input_allocate_device_#t~ret28#1.base, input_allocate_device_#t~ret28#1.offset; [2025-03-04 03:11:05,870 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume false; [2025-03-04 03:11:05,870 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume !false; [2025-03-04 03:11:05,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4224: havoc input_register_device_#t~nondet116#1; [2025-03-04 03:11:05,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: havoc __create_pipe_#t~mem26#1;havoc __create_pipe_#t~bitwise27#1; [2025-03-04 03:11:05,908 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2025-03-04 03:11:05,908 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:11:05,924 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:11:05,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:11:05,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:11:05 BoogieIcfgContainer [2025-03-04 03:11:05,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:11:05,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:11:05,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:11:05,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:11:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:10:59" (1/3) ... [2025-03-04 03:11:05,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8159a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:11:05, skipping insertion in model container [2025-03-04 03:11:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:00" (2/3) ... [2025-03-04 03:11:05,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8159a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:11:05, skipping insertion in model container [2025-03-04 03:11:05,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:11:05" (3/3) ... [2025-03-04 03:11:05,934 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-04 03:11:05,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:11:05,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i that has 16 procedures, 208 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 03:11:05,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:11:05,998 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;@57daf036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:11:05,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:11:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 161 states have (on average 1.329192546583851) internal successors, (214), 169 states have internal predecessors, (214), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 03:11:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 03:11:06,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:06,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:06,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2127051673, now seen corresponding path program 1 times [2025-03-04 03:11:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643286786] [2025-03-04 03:11:06,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:07,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 03:11:07,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 03:11:07,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:07,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643286786] [2025-03-04 03:11:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643286786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:11:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612353750] [2025-03-04 03:11:07,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:07,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:11:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:07,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:11:07,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:07,642 INFO L87 Difference]: Start difference. First operand has 207 states, 161 states have (on average 1.329192546583851) internal successors, (214), 169 states have internal predecessors, (214), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:11:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:07,839 INFO L93 Difference]: Finished difference Result 569 states and 772 transitions. [2025-03-04 03:11:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:11:07,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 03:11:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:07,849 INFO L225 Difference]: With dead ends: 569 [2025-03-04 03:11:07,849 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 03:11:07,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:07,854 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 241 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:07,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 517 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 03:11:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2025-03-04 03:11:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 291 states have (on average 1.2474226804123711) internal successors, (363), 295 states have internal predecessors, (363), 50 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 03:11:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 459 transitions. [2025-03-04 03:11:07,916 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 459 transitions. Word has length 17 [2025-03-04 03:11:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:07,916 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 459 transitions. [2025-03-04 03:11:07,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:11:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 459 transitions. [2025-03-04 03:11:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 03:11:07,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:07,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:07,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:11:07,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:07,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1513830533, now seen corresponding path program 1 times [2025-03-04 03:11:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241794718] [2025-03-04 03:11:07,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:08,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 03:11:08,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 03:11:08,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:08,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241794718] [2025-03-04 03:11:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241794718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:08,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:11:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016421560] [2025-03-04 03:11:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:08,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:11:08,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:08,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:11:08,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:08,998 INFO L87 Difference]: Start difference. First operand 366 states and 459 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:11:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:09,174 INFO L93 Difference]: Finished difference Result 1059 states and 1338 transitions. [2025-03-04 03:11:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:11:09,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 03:11:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:09,181 INFO L225 Difference]: With dead ends: 1059 [2025-03-04 03:11:09,181 INFO L226 Difference]: Without dead ends: 703 [2025-03-04 03:11:09,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:09,185 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 231 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:09,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 529 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-04 03:11:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 696. [2025-03-04 03:11:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 557 states have (on average 1.244165170556553) internal successors, (693), 560 states have internal predecessors, (693), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-04 03:11:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 875 transitions. [2025-03-04 03:11:09,222 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 875 transitions. Word has length 18 [2025-03-04 03:11:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:09,223 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 875 transitions. [2025-03-04 03:11:09,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:11:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 875 transitions. [2025-03-04 03:11:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 03:11:09,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:09,224 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] [2025-03-04 03:11:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:11:09,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:09,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash 8914999, now seen corresponding path program 1 times [2025-03-04 03:11:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621181734] [2025-03-04 03:11:09,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:10,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 03:11:10,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 03:11:10,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:10,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:10,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:10,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621181734] [2025-03-04 03:11:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621181734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:11:10,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066325902] [2025-03-04 03:11:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:10,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:11:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:10,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:11:10,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:10,266 INFO L87 Difference]: Start difference. First operand 696 states and 875 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:11:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:10,381 INFO L93 Difference]: Finished difference Result 1426 states and 1810 transitions. [2025-03-04 03:11:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:11:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-03-04 03:11:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:10,388 INFO L225 Difference]: With dead ends: 1426 [2025-03-04 03:11:10,388 INFO L226 Difference]: Without dead ends: 747 [2025-03-04 03:11:10,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:10,391 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 108 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:10,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 352 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-04 03:11:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 735. [2025-03-04 03:11:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 596 states have (on average 1.2466442953020134) internal successors, (743), 599 states have internal predecessors, (743), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-04 03:11:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 925 transitions. [2025-03-04 03:11:10,432 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 925 transitions. Word has length 51 [2025-03-04 03:11:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:10,433 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 925 transitions. [2025-03-04 03:11:10,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 03:11:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 925 transitions. [2025-03-04 03:11:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 03:11:10,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:10,437 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 03:11:10,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:11:10,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:10,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -455301623, now seen corresponding path program 1 times [2025-03-04 03:11:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:10,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113333888] [2025-03-04 03:11:10,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:11,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 03:11:11,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 03:11:11,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:11,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:11:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113333888] [2025-03-04 03:11:12,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113333888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:11:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354839471] [2025-03-04 03:11:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:12,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:11:12,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:11:12,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:11:13,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 03:11:13,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 03:11:13,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:13,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:13,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 03:11:13,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:11:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 03:11:13,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:11:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354839471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:11:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-04 03:11:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852248175] [2025-03-04 03:11:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:13,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:11:13,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:13,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:11:13,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 03:11:13,592 INFO L87 Difference]: Start difference. First operand 735 states and 925 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:11:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:13,710 INFO L93 Difference]: Finished difference Result 1207 states and 1515 transitions. [2025-03-04 03:11:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:11:13,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2025-03-04 03:11:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:13,714 INFO L225 Difference]: With dead ends: 1207 [2025-03-04 03:11:13,715 INFO L226 Difference]: Without dead ends: 490 [2025-03-04 03:11:13,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 03:11:13,719 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:13,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 687 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-04 03:11:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-04 03:11:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 393 states have (on average 1.2315521628498727) internal successors, (484), 396 states have internal predecessors, (484), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 03:11:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 606 transitions. [2025-03-04 03:11:13,742 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 606 transitions. Word has length 90 [2025-03-04 03:11:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:13,744 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 606 transitions. [2025-03-04 03:11:13,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:11:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 606 transitions. [2025-03-04 03:11:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 03:11:13,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:13,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:13,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 03:11:13,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:13,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:13,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1442086430, now seen corresponding path program 1 times [2025-03-04 03:11:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:13,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737263983] [2025-03-04 03:11:13,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:14,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 03:11:14,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 03:11:14,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:14,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:11:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737263983] [2025-03-04 03:11:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737263983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:11:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610668828] [2025-03-04 03:11:15,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:15,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:11:15,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:11:15,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 03:11:16,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 03:11:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 03:11:16,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:16,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:16,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 03:11:16,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:11:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 03:11:16,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:11:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610668828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:16,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:11:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-04 03:11:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593183344] [2025-03-04 03:11:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:16,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:11:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:16,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:11:16,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:11:16,738 INFO L87 Difference]: Start difference. First operand 490 states and 606 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:11:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:16,834 INFO L93 Difference]: Finished difference Result 967 states and 1198 transitions. [2025-03-04 03:11:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:11:16,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-03-04 03:11:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:16,837 INFO L225 Difference]: With dead ends: 967 [2025-03-04 03:11:16,837 INFO L226 Difference]: Without dead ends: 490 [2025-03-04 03:11:16,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:11:16,839 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:16,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1148 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-04 03:11:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-04 03:11:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 393 states have (on average 1.2290076335877862) internal successors, (483), 396 states have internal predecessors, (483), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 03:11:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 605 transitions. [2025-03-04 03:11:16,860 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 605 transitions. Word has length 87 [2025-03-04 03:11:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:16,861 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 605 transitions. [2025-03-04 03:11:16,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:11:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 605 transitions. [2025-03-04 03:11:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 03:11:16,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:16,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 03:11:16,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 03:11:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:17,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash 736329814, now seen corresponding path program 1 times [2025-03-04 03:11:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:17,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197033496] [2025-03-04 03:11:17,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:17,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 03:11:17,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 03:11:17,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:17,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:11:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197033496] [2025-03-04 03:11:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197033496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:11:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540892151] [2025-03-04 03:11:18,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:11:18,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:11:18,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 03:11:19,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 03:11:19,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 03:11:19,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:19,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:19,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 03:11:19,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:11:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:11:19,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:11:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540892151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:11:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2025-03-04 03:11:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905603409] [2025-03-04 03:11:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:19,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 03:11:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:19,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 03:11:19,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 03:11:19,905 INFO L87 Difference]: Start difference. First operand 490 states and 605 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 03:11:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:20,231 INFO L93 Difference]: Finished difference Result 998 states and 1243 transitions. [2025-03-04 03:11:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 03:11:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-03-04 03:11:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:20,237 INFO L225 Difference]: With dead ends: 998 [2025-03-04 03:11:20,237 INFO L226 Difference]: Without dead ends: 526 [2025-03-04 03:11:20,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 03:11:20,239 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:20,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2061 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:11:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-04 03:11:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2025-03-04 03:11:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 420 states have (on average 1.2214285714285715) internal successors, (513), 423 states have internal predecessors, (513), 63 states have call successors, (63), 34 states have call predecessors, (63), 39 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2025-03-04 03:11:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 650 transitions. [2025-03-04 03:11:20,262 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 650 transitions. Word has length 92 [2025-03-04 03:11:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 650 transitions. [2025-03-04 03:11:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 03:11:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 650 transitions. [2025-03-04 03:11:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 03:11:20,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:20,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:20,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 03:11:20,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:20,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:20,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:20,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1630364780, now seen corresponding path program 1 times [2025-03-04 03:11:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:20,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920966136] [2025-03-04 03:11:20,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:21,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 03:11:21,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 03:11:21,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:21,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:11:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:21,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920966136] [2025-03-04 03:11:21,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920966136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:11:21,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412322291] [2025-03-04 03:11:21,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:21,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:21,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:11:21,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:11:21,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 03:11:22,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 03:11:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 03:11:23,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:23,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:23,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 03:11:23,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:11:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:11:23,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:11:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:11:23,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412322291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:11:23,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:11:23,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-03-04 03:11:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429515074] [2025-03-04 03:11:23,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:11:23,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 03:11:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:23,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 03:11:23,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:11:23,415 INFO L87 Difference]: Start difference. First operand 523 states and 650 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 03:11:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:23,655 INFO L93 Difference]: Finished difference Result 1067 states and 1336 transitions. [2025-03-04 03:11:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:11:23,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2025-03-04 03:11:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:23,658 INFO L225 Difference]: With dead ends: 1067 [2025-03-04 03:11:23,658 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 03:11:23,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:11:23,661 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:23,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1793 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:11:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 03:11:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 538. [2025-03-04 03:11:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 432 states have (on average 1.2152777777777777) internal successors, (525), 432 states have internal predecessors, (525), 66 states have call successors, (66), 34 states have call predecessors, (66), 39 states have return successors, (80), 71 states have call predecessors, (80), 62 states have call successors, (80) [2025-03-04 03:11:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 671 transitions. [2025-03-04 03:11:23,687 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 671 transitions. Word has length 92 [2025-03-04 03:11:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:23,688 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 671 transitions. [2025-03-04 03:11:23,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 03:11:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 671 transitions. [2025-03-04 03:11:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 03:11:23,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:23,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:23,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 03:11:23,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:11:23,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:23,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 331209878, now seen corresponding path program 2 times [2025-03-04 03:11:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:23,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140202562] [2025-03-04 03:11:23,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:11:23,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:24,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 03:11:24,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 92 statements. [2025-03-04 03:11:24,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:11:24,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 03:11:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:25,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140202562] [2025-03-04 03:11:25,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140202562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:25,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:25,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:11:25,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635619613] [2025-03-04 03:11:25,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:25,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:11:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:25,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:11:25,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:25,063 INFO L87 Difference]: Start difference. First operand 538 states and 671 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:25,179 INFO L93 Difference]: Finished difference Result 957 states and 1204 transitions. [2025-03-04 03:11:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:11:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-04 03:11:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:25,183 INFO L225 Difference]: With dead ends: 957 [2025-03-04 03:11:25,183 INFO L226 Difference]: Without dead ends: 553 [2025-03-04 03:11:25,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:25,185 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:25,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1367 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-04 03:11:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-04 03:11:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 444 states have (on average 1.2094594594594594) internal successors, (537), 441 states have internal predecessors, (537), 66 states have call successors, (66), 34 states have call predecessors, (66), 42 states have return successors, (85), 77 states have call predecessors, (85), 62 states have call successors, (85) [2025-03-04 03:11:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 688 transitions. [2025-03-04 03:11:25,207 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 688 transitions. Word has length 92 [2025-03-04 03:11:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:25,207 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 688 transitions. [2025-03-04 03:11:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 688 transitions. [2025-03-04 03:11:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 03:11:25,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:25,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 03:11:25,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:11:25,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:25,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash 353842132, now seen corresponding path program 1 times [2025-03-04 03:11:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138225776] [2025-03-04 03:11:25,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:25,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 03:11:25,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 03:11:25,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:25,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 03:11:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:26,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138225776] [2025-03-04 03:11:26,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138225776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:26,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:26,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 03:11:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223248758] [2025-03-04 03:11:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:26,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 03:11:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:26,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 03:11:26,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:11:26,436 INFO L87 Difference]: Start difference. First operand 553 states and 688 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:26,586 INFO L93 Difference]: Finished difference Result 967 states and 1213 transitions. [2025-03-04 03:11:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:11:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-04 03:11:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:26,589 INFO L225 Difference]: With dead ends: 967 [2025-03-04 03:11:26,589 INFO L226 Difference]: Without dead ends: 553 [2025-03-04 03:11:26,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:11:26,593 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:26,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1800 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-04 03:11:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-04 03:11:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 444 states have (on average 1.204954954954955) internal successors, (535), 441 states have internal predecessors, (535), 66 states have call successors, (66), 34 states have call predecessors, (66), 42 states have return successors, (85), 77 states have call predecessors, (85), 62 states have call successors, (85) [2025-03-04 03:11:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 686 transitions. [2025-03-04 03:11:26,606 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 686 transitions. Word has length 92 [2025-03-04 03:11:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:26,606 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 686 transitions. [2025-03-04 03:11:26,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 686 transitions. [2025-03-04 03:11:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 03:11:26,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:26,607 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-03-04 03:11:26,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:11:26,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash -293077739, now seen corresponding path program 1 times [2025-03-04 03:11:26,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:26,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263604926] [2025-03-04 03:11:26,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:27,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 03:11:27,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 03:11:27,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:27,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 03:11:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263604926] [2025-03-04 03:11:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263604926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:11:27,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256243653] [2025-03-04 03:11:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:11:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:27,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:11:27,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:27,644 INFO L87 Difference]: Start difference. First operand 553 states and 686 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 03:11:31,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:11:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:31,969 INFO L93 Difference]: Finished difference Result 972 states and 1216 transitions. [2025-03-04 03:11:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:11:31,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-04 03:11:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:31,975 INFO L225 Difference]: With dead ends: 972 [2025-03-04 03:11:31,975 INFO L226 Difference]: Without dead ends: 969 [2025-03-04 03:11:31,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:31,976 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 311 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:31,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 718 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 03:11:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-04 03:11:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 941. [2025-03-04 03:11:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 762 states have (on average 1.2152230971128608) internal successors, (926), 755 states have internal predecessors, (926), 110 states have call successors, (110), 54 states have call predecessors, (110), 68 states have return successors, (149), 131 states have call predecessors, (149), 106 states have call successors, (149) [2025-03-04 03:11:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1185 transitions. [2025-03-04 03:11:32,002 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1185 transitions. Word has length 95 [2025-03-04 03:11:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:32,003 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1185 transitions. [2025-03-04 03:11:32,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 03:11:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1185 transitions. [2025-03-04 03:11:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 03:11:32,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:32,004 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:32,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:11:32,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1431429398, now seen corresponding path program 1 times [2025-03-04 03:11:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879657864] [2025-03-04 03:11:32,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:32,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 03:11:32,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 03:11:32,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:32,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 03:11:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:32,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879657864] [2025-03-04 03:11:32,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879657864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:32,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:32,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:11:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639210496] [2025-03-04 03:11:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:32,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:11:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:32,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:11:33,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:11:33,000 INFO L87 Difference]: Start difference. First operand 941 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 03:11:37,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:11:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:37,121 INFO L93 Difference]: Finished difference Result 1875 states and 2367 transitions. [2025-03-04 03:11:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:11:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 106 [2025-03-04 03:11:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:37,127 INFO L225 Difference]: With dead ends: 1875 [2025-03-04 03:11:37,127 INFO L226 Difference]: Without dead ends: 919 [2025-03-04 03:11:37,129 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 [2025-03-04 03:11:37,130 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 94 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:37,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 825 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:11:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-03-04 03:11:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 892. [2025-03-04 03:11:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 723 states have (on average 1.210235131396957) internal successors, (875), 720 states have internal predecessors, (875), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 123 states have call predecessors, (143), 105 states have call successors, (143) [2025-03-04 03:11:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1127 transitions. [2025-03-04 03:11:37,158 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1127 transitions. Word has length 106 [2025-03-04 03:11:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:37,158 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1127 transitions. [2025-03-04 03:11:37,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 03:11:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1127 transitions. [2025-03-04 03:11:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 03:11:37,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:37,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-03-04 03:11:37,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:11:37,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash -951268351, now seen corresponding path program 1 times [2025-03-04 03:11:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903886109] [2025-03-04 03:11:37,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:37,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 03:11:37,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 03:11:37,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:37,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 03:11:38,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:38,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903886109] [2025-03-04 03:11:38,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903886109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:38,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:38,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:11:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842787892] [2025-03-04 03:11:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:38,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:11:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:38,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:11:38,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:38,317 INFO L87 Difference]: Start difference. First operand 892 states and 1127 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:11:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:38,442 INFO L93 Difference]: Finished difference Result 1322 states and 1677 transitions. [2025-03-04 03:11:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:11:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-04 03:11:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:38,448 INFO L225 Difference]: With dead ends: 1322 [2025-03-04 03:11:38,448 INFO L226 Difference]: Without dead ends: 900 [2025-03-04 03:11:38,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:38,449 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:38,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1398 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-04 03:11:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2025-03-04 03:11:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 731 states have (on average 1.207934336525308) internal successors, (883), 724 states have internal predecessors, (883), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 127 states have call predecessors, (143), 105 states have call successors, (143) [2025-03-04 03:11:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1135 transitions. [2025-03-04 03:11:38,473 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1135 transitions. Word has length 114 [2025-03-04 03:11:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:38,474 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1135 transitions. [2025-03-04 03:11:38,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:11:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1135 transitions. [2025-03-04 03:11:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 03:11:38,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:38,476 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 03:11:38,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 03:11:38,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:38,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:38,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1980627649, now seen corresponding path program 1 times [2025-03-04 03:11:38,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:38,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555826855] [2025-03-04 03:11:38,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:39,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 03:11:39,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 03:11:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 03:11:39,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555826855] [2025-03-04 03:11:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555826855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 03:11:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499879237] [2025-03-04 03:11:39,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:39,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 03:11:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:39,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 03:11:39,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:11:39,655 INFO L87 Difference]: Start difference. First operand 900 states and 1135 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:11:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:39,833 INFO L93 Difference]: Finished difference Result 954 states and 1195 transitions. [2025-03-04 03:11:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:11:39,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-04 03:11:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:39,837 INFO L225 Difference]: With dead ends: 954 [2025-03-04 03:11:39,838 INFO L226 Difference]: Without dead ends: 904 [2025-03-04 03:11:39,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:11:39,838 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:39,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1807 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:11:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-04 03:11:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2025-03-04 03:11:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 735 states have (on average 1.2068027210884353) internal successors, (887), 728 states have internal predecessors, (887), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 127 states have call predecessors, (143), 105 states have call successors, (143) [2025-03-04 03:11:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1139 transitions. [2025-03-04 03:11:39,865 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1139 transitions. Word has length 114 [2025-03-04 03:11:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:39,865 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1139 transitions. [2025-03-04 03:11:39,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:11:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1139 transitions. [2025-03-04 03:11:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 03:11:39,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:39,867 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-03-04 03:11:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 03:11:39,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash 300430687, now seen corresponding path program 1 times [2025-03-04 03:11:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212428623] [2025-03-04 03:11:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:39,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:40,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 03:11:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 03:11:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 03:11:41,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212428623] [2025-03-04 03:11:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212428623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:11:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258657215] [2025-03-04 03:11:41,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:41,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:11:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:41,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:11:41,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:41,057 INFO L87 Difference]: Start difference. First operand 904 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 03:11:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:41,120 INFO L93 Difference]: Finished difference Result 1710 states and 2173 transitions. [2025-03-04 03:11:41,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:11:41,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-03-04 03:11:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:41,124 INFO L225 Difference]: With dead ends: 1710 [2025-03-04 03:11:41,124 INFO L226 Difference]: Without dead ends: 864 [2025-03-04 03:11:41,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:41,126 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:41,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:11:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-04 03:11:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-03-04 03:11:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 701 states have (on average 1.2025677603423681) internal successors, (843), 698 states have internal predecessors, (843), 105 states have call successors, (105), 48 states have call predecessors, (105), 57 states have return successors, (133), 117 states have call predecessors, (133), 101 states have call successors, (133) [2025-03-04 03:11:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1081 transitions. [2025-03-04 03:11:41,149 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1081 transitions. Word has length 115 [2025-03-04 03:11:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:41,149 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1081 transitions. [2025-03-04 03:11:41,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 03:11:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1081 transitions. [2025-03-04 03:11:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 03:11:41,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:41,151 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-03-04 03:11:41,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 03:11:41,151 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:41,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2141168034, now seen corresponding path program 1 times [2025-03-04 03:11:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:41,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934221513] [2025-03-04 03:11:41,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:41,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 03:11:41,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 03:11:41,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 03:11:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:42,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934221513] [2025-03-04 03:11:42,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934221513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:42,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:42,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:11:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435828035] [2025-03-04 03:11:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:42,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:11:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:42,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:11:42,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:42,156 INFO L87 Difference]: Start difference. First operand 864 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 03:11:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:42,260 INFO L93 Difference]: Finished difference Result 1754 states and 2211 transitions. [2025-03-04 03:11:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:11:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2025-03-04 03:11:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:42,264 INFO L225 Difference]: With dead ends: 1754 [2025-03-04 03:11:42,265 INFO L226 Difference]: Without dead ends: 864 [2025-03-04 03:11:42,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:42,267 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 2 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:42,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 679 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-04 03:11:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-03-04 03:11:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 701 states have (on average 1.195435092724679) internal successors, (838), 698 states have internal predecessors, (838), 105 states have call successors, (105), 48 states have call predecessors, (105), 57 states have return successors, (133), 117 states have call predecessors, (133), 101 states have call successors, (133) [2025-03-04 03:11:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1076 transitions. [2025-03-04 03:11:42,290 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1076 transitions. Word has length 117 [2025-03-04 03:11:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:42,290 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1076 transitions. [2025-03-04 03:11:42,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 03:11:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1076 transitions. [2025-03-04 03:11:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 03:11:42,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:42,292 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-03-04 03:11:42,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 03:11:42,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash -102982398, now seen corresponding path program 1 times [2025-03-04 03:11:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:42,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268416075] [2025-03-04 03:11:42,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:42,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:43,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 03:11:43,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 03:11:43,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:43,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 03:11:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:43,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268416075] [2025-03-04 03:11:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268416075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:43,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:43,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:11:43,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710169630] [2025-03-04 03:11:43,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:43,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:11:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:43,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:11:43,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:11:43,623 INFO L87 Difference]: Start difference. First operand 864 states and 1076 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 03:11:47,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:11:51,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:11:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:52,942 INFO L93 Difference]: Finished difference Result 2342 states and 2912 transitions. [2025-03-04 03:11:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:11:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2025-03-04 03:11:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:52,950 INFO L225 Difference]: With dead ends: 2342 [2025-03-04 03:11:52,951 INFO L226 Difference]: Without dead ends: 1860 [2025-03-04 03:11:52,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:11:52,954 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 479 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 127 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:52,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 624 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 397 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-03-04 03:11:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-03-04 03:11:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1700. [2025-03-04 03:11:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1372 states have (on average 1.2011661807580174) internal successors, (1648), 1374 states have internal predecessors, (1648), 205 states have call successors, (205), 98 states have call predecessors, (205), 122 states have return successors, (271), 227 states have call predecessors, (271), 200 states have call successors, (271) [2025-03-04 03:11:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2124 transitions. [2025-03-04 03:11:53,004 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2124 transitions. Word has length 121 [2025-03-04 03:11:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:53,004 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2124 transitions. [2025-03-04 03:11:53,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 03:11:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2124 transitions. [2025-03-04 03:11:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 03:11:53,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:53,006 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:53,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 03:11:53,006 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:53,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1833462330, now seen corresponding path program 1 times [2025-03-04 03:11:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:53,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841753303] [2025-03-04 03:11:53,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:54,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 03:11:54,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 03:11:54,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:54,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 03:11:54,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841753303] [2025-03-04 03:11:54,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841753303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:54,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:11:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719930641] [2025-03-04 03:11:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:54,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:11:54,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:54,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:11:54,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:54,898 INFO L87 Difference]: Start difference. First operand 1700 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:11:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:55,023 INFO L93 Difference]: Finished difference Result 2432 states and 3035 transitions. [2025-03-04 03:11:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:11:55,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2025-03-04 03:11:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:55,028 INFO L225 Difference]: With dead ends: 2432 [2025-03-04 03:11:55,028 INFO L226 Difference]: Without dead ends: 922 [2025-03-04 03:11:55,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:55,032 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:55,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 678 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:11:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-04 03:11:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-03-04 03:11:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 742 states have (on average 1.1913746630727762) internal successors, (884), 743 states have internal predecessors, (884), 112 states have call successors, (112), 55 states have call predecessors, (112), 67 states have return successors, (145), 123 states have call predecessors, (145), 107 states have call successors, (145) [2025-03-04 03:11:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1141 transitions. [2025-03-04 03:11:55,054 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1141 transitions. Word has length 144 [2025-03-04 03:11:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:55,055 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1141 transitions. [2025-03-04 03:11:55,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:11:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1141 transitions. [2025-03-04 03:11:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 03:11:55,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:55,057 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:55,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 03:11:55,057 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:55,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:55,057 INFO L85 PathProgramCache]: Analyzing trace with hash -626937978, now seen corresponding path program 1 times [2025-03-04 03:11:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775320395] [2025-03-04 03:11:55,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:55,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 03:11:56,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 03:11:56,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:56,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 03:11:56,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:56,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775320395] [2025-03-04 03:11:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775320395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:56,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:11:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908331713] [2025-03-04 03:11:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:11:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:56,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:11:56,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:56,271 INFO L87 Difference]: Start difference. First operand 922 states and 1141 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 03:12:00,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:12:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:00,571 INFO L93 Difference]: Finished difference Result 1486 states and 1840 transitions. [2025-03-04 03:12:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:12:00,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 144 [2025-03-04 03:12:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:00,579 INFO L225 Difference]: With dead ends: 1486 [2025-03-04 03:12:00,579 INFO L226 Difference]: Without dead ends: 1481 [2025-03-04 03:12:00,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:12:00,580 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 216 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:00,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 641 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 03:12:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-03-04 03:12:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1444. [2025-03-04 03:12:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1164 states have (on average 1.1898625429553265) internal successors, (1385), 1161 states have internal predecessors, (1385), 174 states have call successors, (174), 84 states have call predecessors, (174), 105 states have return successors, (237), 198 states have call predecessors, (237), 169 states have call successors, (237) [2025-03-04 03:12:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1796 transitions. [2025-03-04 03:12:00,638 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1796 transitions. Word has length 144 [2025-03-04 03:12:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:00,638 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1796 transitions. [2025-03-04 03:12:00,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 03:12:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1796 transitions. [2025-03-04 03:12:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 03:12:00,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:00,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:00,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 03:12:00,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:00,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash 864848446, now seen corresponding path program 1 times [2025-03-04 03:12:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:00,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447081189] [2025-03-04 03:12:00,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:01,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 03:12:01,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 03:12:01,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:01,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 03:12:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447081189] [2025-03-04 03:12:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447081189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:12:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345939469] [2025-03-04 03:12:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:01,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:12:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:01,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:12:01,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:12:01,738 INFO L87 Difference]: Start difference. First operand 1444 states and 1796 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:12:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:01,930 INFO L93 Difference]: Finished difference Result 1488 states and 1842 transitions. [2025-03-04 03:12:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:12:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 157 [2025-03-04 03:12:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:01,937 INFO L225 Difference]: With dead ends: 1488 [2025-03-04 03:12:01,938 INFO L226 Difference]: Without dead ends: 1469 [2025-03-04 03:12:01,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:01,939 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 235 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:01,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 495 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:12:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-03-04 03:12:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1450. [2025-03-04 03:12:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1170 states have (on average 1.1854700854700855) internal successors, (1387), 1167 states have internal predecessors, (1387), 174 states have call successors, (174), 84 states have call predecessors, (174), 105 states have return successors, (237), 198 states have call predecessors, (237), 169 states have call successors, (237) [2025-03-04 03:12:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1798 transitions. [2025-03-04 03:12:02,004 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1798 transitions. Word has length 157 [2025-03-04 03:12:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 1798 transitions. [2025-03-04 03:12:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 03:12:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1798 transitions. [2025-03-04 03:12:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 03:12:02,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:02,007 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:02,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 03:12:02,007 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:02,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -992464504, now seen corresponding path program 1 times [2025-03-04 03:12:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208105376] [2025-03-04 03:12:02,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:02,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 03:12:02,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 03:12:02,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:02,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 03:12:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208105376] [2025-03-04 03:12:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208105376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:12:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182352562] [2025-03-04 03:12:03,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:03,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:12:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:12:03,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:12:03,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 03:12:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 03:12:04,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 03:12:04,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:04,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:04,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 2381 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:12:04,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:12:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 03:12:05,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:12:05,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182352562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:05,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:12:05,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 03:12:05,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101510923] [2025-03-04 03:12:05,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:05,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:12:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:05,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:12:05,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:05,049 INFO L87 Difference]: Start difference. First operand 1450 states and 1798 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 03:12:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:05,197 INFO L93 Difference]: Finished difference Result 2002 states and 2474 transitions. [2025-03-04 03:12:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:12:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 162 [2025-03-04 03:12:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:05,201 INFO L225 Difference]: With dead ends: 2002 [2025-03-04 03:12:05,201 INFO L226 Difference]: Without dead ends: 714 [2025-03-04 03:12:05,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:05,204 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 69 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:05,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 436 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:12:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-04 03:12:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 708. [2025-03-04 03:12:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 569 states have (on average 1.1739894551845342) internal successors, (668), 570 states have internal predecessors, (668), 83 states have call successors, (83), 47 states have call predecessors, (83), 55 states have return successors, (102), 90 states have call predecessors, (102), 79 states have call successors, (102) [2025-03-04 03:12:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 853 transitions. [2025-03-04 03:12:05,226 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 853 transitions. Word has length 162 [2025-03-04 03:12:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:05,226 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 853 transitions. [2025-03-04 03:12:05,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 03:12:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 853 transitions. [2025-03-04 03:12:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 03:12:05,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:05,228 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:05,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 03:12:05,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:12:05,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:05,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash -133712981, now seen corresponding path program 1 times [2025-03-04 03:12:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:05,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602012839] [2025-03-04 03:12:05,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:06,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 03:12:06,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 03:12:06,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:06,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 03:12:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602012839] [2025-03-04 03:12:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602012839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:06,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:06,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:12:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832114958] [2025-03-04 03:12:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:06,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:12:06,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:06,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:12:06,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:12:06,513 INFO L87 Difference]: Start difference. First operand 708 states and 853 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 03:12:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:06,581 INFO L93 Difference]: Finished difference Result 1002 states and 1212 transitions. [2025-03-04 03:12:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:12:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 174 [2025-03-04 03:12:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:06,585 INFO L225 Difference]: With dead ends: 1002 [2025-03-04 03:12:06,585 INFO L226 Difference]: Without dead ends: 460 [2025-03-04 03:12:06,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:12:06,586 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:06,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:12:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-04 03:12:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-03-04 03:12:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 370 states have (on average 1.162162162162162) internal successors, (430), 371 states have internal predecessors, (430), 55 states have call successors, (55), 32 states have call predecessors, (55), 34 states have return successors, (61), 56 states have call predecessors, (61), 51 states have call successors, (61) [2025-03-04 03:12:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 546 transitions. [2025-03-04 03:12:06,605 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 546 transitions. Word has length 174 [2025-03-04 03:12:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:06,605 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 546 transitions. [2025-03-04 03:12:06,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 03:12:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 546 transitions. [2025-03-04 03:12:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 03:12:06,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:06,606 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:06,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 03:12:06,607 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 180547758, now seen corresponding path program 1 times [2025-03-04 03:12:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503532748] [2025-03-04 03:12:06,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:07,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 03:12:07,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 03:12:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 03:12:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:07,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503532748] [2025-03-04 03:12:07,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503532748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:07,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:07,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:12:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332531977] [2025-03-04 03:12:07,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:07,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:12:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:07,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:12:07,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:12:07,979 INFO L87 Difference]: Start difference. First operand 460 states and 546 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 03:12:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:08,055 INFO L93 Difference]: Finished difference Result 807 states and 962 transitions. [2025-03-04 03:12:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:12:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 176 [2025-03-04 03:12:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:08,058 INFO L225 Difference]: With dead ends: 807 [2025-03-04 03:12:08,059 INFO L226 Difference]: Without dead ends: 460 [2025-03-04 03:12:08,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:12:08,061 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 2 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:08,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 442 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:12:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-04 03:12:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-03-04 03:12:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 370 states have (on average 1.1567567567567567) internal successors, (428), 371 states have internal predecessors, (428), 55 states have call successors, (55), 32 states have call predecessors, (55), 34 states have return successors, (61), 56 states have call predecessors, (61), 51 states have call successors, (61) [2025-03-04 03:12:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 544 transitions. [2025-03-04 03:12:08,076 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 544 transitions. Word has length 176 [2025-03-04 03:12:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:08,077 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 544 transitions. [2025-03-04 03:12:08,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 03:12:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 544 transitions. [2025-03-04 03:12:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 03:12:08,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:08,079 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:08,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 03:12:08,079 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1712046366, now seen corresponding path program 1 times [2025-03-04 03:12:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391702866] [2025-03-04 03:12:08,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 03:12:09,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 03:12:09,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:09,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 03:12:09,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391702866] [2025-03-04 03:12:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391702866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:12:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652006164] [2025-03-04 03:12:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:09,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:12:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:09,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:12:09,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:12:09,618 INFO L87 Difference]: Start difference. First operand 460 states and 544 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 03:12:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:09,847 INFO L93 Difference]: Finished difference Result 820 states and 976 transitions. [2025-03-04 03:12:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:12:09,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 178 [2025-03-04 03:12:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:09,851 INFO L225 Difference]: With dead ends: 820 [2025-03-04 03:12:09,851 INFO L226 Difference]: Without dead ends: 470 [2025-03-04 03:12:09,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:12:09,853 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:09,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1074 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:12:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-04 03:12:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2025-03-04 03:12:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 376 states have (on average 1.1542553191489362) internal successors, (434), 377 states have internal predecessors, (434), 55 states have call successors, (55), 32 states have call predecessors, (55), 34 states have return successors, (61), 56 states have call predecessors, (61), 51 states have call successors, (61) [2025-03-04 03:12:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 550 transitions. [2025-03-04 03:12:09,867 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 550 transitions. Word has length 178 [2025-03-04 03:12:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:09,867 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 550 transitions. [2025-03-04 03:12:09,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 03:12:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 550 transitions. [2025-03-04 03:12:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 03:12:09,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:09,868 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:09,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 03:12:09,869 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1856468089, now seen corresponding path program 1 times [2025-03-04 03:12:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024309442] [2025-03-04 03:12:09,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:10,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 03:12:10,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 03:12:10,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:10,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 03:12:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:11,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024309442] [2025-03-04 03:12:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024309442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:12:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899681421] [2025-03-04 03:12:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:11,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:12:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:11,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:12:11,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:12:11,211 INFO L87 Difference]: Start difference. First operand 466 states and 550 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 03:12:15,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:12:19,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:12:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:19,673 INFO L93 Difference]: Finished difference Result 475 states and 557 transitions. [2025-03-04 03:12:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:12:19,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 179 [2025-03-04 03:12:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:19,676 INFO L225 Difference]: With dead ends: 475 [2025-03-04 03:12:19,676 INFO L226 Difference]: Without dead ends: 412 [2025-03-04 03:12:19,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:12:19,676 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 232 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:19,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 543 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 312 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-04 03:12:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-04 03:12:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 287. [2025-03-04 03:12:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 229 states have (on average 1.1266375545851528) internal successors, (258), 231 states have internal predecessors, (258), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (34), 32 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-04 03:12:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 327 transitions. [2025-03-04 03:12:19,686 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 327 transitions. Word has length 179 [2025-03-04 03:12:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:19,686 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 327 transitions. [2025-03-04 03:12:19,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 03:12:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 327 transitions. [2025-03-04 03:12:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 03:12:19,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:19,688 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:19,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 03:12:19,688 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -865327628, now seen corresponding path program 1 times [2025-03-04 03:12:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005315487] [2025-03-04 03:12:19,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:20,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 03:12:20,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 03:12:20,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:20,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 03:12:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:20,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005315487] [2025-03-04 03:12:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005315487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:12:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98638560] [2025-03-04 03:12:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:20,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:12:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:20,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:12:20,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:20,722 INFO L87 Difference]: Start difference. First operand 287 states and 327 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 03:12:24,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:12:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:24,848 INFO L93 Difference]: Finished difference Result 293 states and 332 transitions. [2025-03-04 03:12:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:12:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 209 [2025-03-04 03:12:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:24,850 INFO L225 Difference]: With dead ends: 293 [2025-03-04 03:12:24,850 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 03:12:24,851 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 [2025-03-04 03:12:24,851 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 76 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:24,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 715 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:12:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 03:12:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 03:12:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:12:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 03:12:24,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2025-03-04 03:12:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:24,853 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 03:12:24,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 03:12:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 03:12:24,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 03:12:24,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 03:12:24,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 03:12:24,857 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:24,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.