./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-?-c7c6ca5-m [2024-11-09 03:25:33,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 03:25:33,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-09 03:25:33,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 03:25:33,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 03:25:33,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 03:25:33,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 03:25:33,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 03:25:33,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 03:25:33,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 03:25:33,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 03:25:33,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 03:25:33,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 03:25:33,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 03:25:33,693 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 03:25:33,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 03:25:33,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 03:25:33,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 03:25:33,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 03:25:33,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 03:25:33,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 03:25:33,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 03:25:33,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 03:25:33,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 03:25:33,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 03:25:33,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 03:25:33,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 03:25:33,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 03:25:33,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 03:25:33,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 03:25:33,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 03:25:33,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 03:25:33,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 03:25:33,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 03:25:33,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 03:25:33,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 03:25:33,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 03:25:33,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 03:25:33,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 03:25:33,701 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-09 03:25:33,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 03:25:33,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 03:25:33,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 03:25:33,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 03:25:33,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 03:25:33,965 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 [2024-11-09 03:25:35,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 03:25:35,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 03:25:35,706 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 [2024-11-09 03:25:35,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038be95d2/b0303b515d0443cabc59f45128f27c98/FLAGd69d67add [2024-11-09 03:25:35,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038be95d2/b0303b515d0443cabc59f45128f27c98 [2024-11-09 03:25:35,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 03:25:35,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 03:25:35,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 03:25:35,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 03:25:35,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 03:25:35,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:35" (1/1) ... [2024-11-09 03:25:35,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@424f2383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:35, skipping insertion in model container [2024-11-09 03:25:35,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:35" (1/1) ... [2024-11-09 03:25:35,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 03:25:36,428 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] [2024-11-09 03:25:36,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 03:25:36,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 03:25:36,646 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] [2024-11-09 03:25:36,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 03:25:36,704 INFO L204 MainTranslator]: Completed translation [2024-11-09 03:25:36,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36 WrapperNode [2024-11-09 03:25:36,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 03:25:36,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 03:25:36,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 03:25:36,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 03:25:36,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:36,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:36,812 INFO L138 Inliner]: procedures = 78, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 1024 [2024-11-09 03:25:36,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 03:25:36,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 03:25:36,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 03:25:36,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 03:25:36,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:36,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:36,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:36,912 INFO L175 MemorySlicer]: Split 160 memory accesses to 6 slices as follows [2, 6, 82, 8, 42, 20]. 51 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 6, 6, 8, 0, 1]. The 103 writes are split as follows [0, 0, 42, 0, 42, 19]. [2024-11-09 03:25:36,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:36,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:37,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:37,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:37,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:37,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:37,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 03:25:37,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 03:25:37,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 03:25:37,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 03:25:37,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (1/1) ... [2024-11-09 03:25:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 03:25:37,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 03:25:37,105 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) [2024-11-09 03:25:37,107 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 [2024-11-09 03:25:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2024-11-09 03:25:37,142 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2024-11-09 03:25:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 03:25:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-11-09 03:25:37,142 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-11-09 03:25:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 03:25:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 03:25:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 03:25:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 03:25:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 03:25:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2024-11-09 03:25:37,144 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2024-11-09 03:25:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2024-11-09 03:25:37,144 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2024-11-09 03:25:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-09 03:25:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-09 03:25:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-11-09 03:25:37,145 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 03:25:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 03:25:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2024-11-09 03:25:37,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2024-11-09 03:25:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 03:25:37,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 03:25:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2024-11-09 03:25:37,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2024-11-09 03:25:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 03:25:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-11-09 03:25:37,147 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-11-09 03:25:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-09 03:25:37,148 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-09 03:25:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-11-09 03:25:37,148 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-11-09 03:25:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 03:25:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 03:25:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 03:25:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 03:25:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 03:25:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 03:25:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-11-09 03:25:37,149 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-11-09 03:25:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2024-11-09 03:25:37,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2024-11-09 03:25:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2024-11-09 03:25:37,149 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2024-11-09 03:25:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2024-11-09 03:25:37,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2024-11-09 03:25:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 03:25:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 03:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 03:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 03:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 03:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 03:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 03:25:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 03:25:37,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 03:25:37,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 03:25:37,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 03:25:37,495 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2024-11-09 03:25:37,503 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 03:25:42,318 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2024-11-09 03:25:42,318 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2024-11-09 03:25:42,375 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2024-11-09 03:25:42,375 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 03:25:42,390 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 03:25:42,390 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 03:25:42,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:42 BoogieIcfgContainer [2024-11-09 03:25:42,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 03:25:42,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 03:25:42,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 03:25:42,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 03:25:42,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:25:35" (1/3) ... [2024-11-09 03:25:42,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:25:42, skipping insertion in model container [2024-11-09 03:25:42,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:36" (2/3) ... [2024-11-09 03:25:42,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:25:42, skipping insertion in model container [2024-11-09 03:25:42,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:42" (3/3) ... [2024-11-09 03:25:42,400 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2024-11-09 03:25:42,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 03:25:42,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 03:25:42,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 03:25:42,466 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;@2f82247b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 03:25:42,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 03:25:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 160 states have (on average 1.3625) internal successors, (218), 168 states have internal predecessors, (218), 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) [2024-11-09 03:25:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 03:25:42,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:25:42,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:25:42,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:25:42,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:25:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -244939124, now seen corresponding path program 1 times [2024-11-09 03:25:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:25:42,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425026388] [2024-11-09 03:25:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:25:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:25:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:25:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 03:25:44,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:25:44,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425026388] [2024-11-09 03:25:44,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425026388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:25:44,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:25:44,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 03:25:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10359471] [2024-11-09 03:25:44,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:25:44,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 03:25:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:25:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 03:25:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:25:44,689 INFO L87 Difference]: Start difference. First operand has 206 states, 160 states have (on average 1.3625) internal successors, (218), 168 states have internal predecessors, (218), 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) [2024-11-09 03:25:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:25:44,770 INFO L93 Difference]: Finished difference Result 566 states and 784 transitions. [2024-11-09 03:25:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 03:25:44,777 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 [2024-11-09 03:25:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:25:44,789 INFO L225 Difference]: With dead ends: 566 [2024-11-09 03:25:44,790 INFO L226 Difference]: Without dead ends: 368 [2024-11-09 03:25:44,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:25:44,797 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 240 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 03:25:44,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 544 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 03:25:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-09 03:25:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2024-11-09 03:25:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 289 states have (on average 1.2491349480968859) internal successors, (361), 293 states have internal predecessors, (361), 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) [2024-11-09 03:25:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 457 transitions. [2024-11-09 03:25:44,854 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 457 transitions. Word has length 17 [2024-11-09 03:25:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:25:44,855 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 457 transitions. [2024-11-09 03:25:44,855 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) [2024-11-09 03:25:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 457 transitions. [2024-11-09 03:25:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 03:25:44,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:25:44,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:25:44,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 03:25:44,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:25:44,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:25:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash 996714932, now seen corresponding path program 1 times [2024-11-09 03:25:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:25:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652603508] [2024-11-09 03:25:44,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:25:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:25:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:45,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:25:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 03:25:45,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:25:45,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652603508] [2024-11-09 03:25:45,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652603508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:25:45,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:25:45,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 03:25:45,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503875283] [2024-11-09 03:25:45,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:25:45,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 03:25:45,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:25:45,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 03:25:45,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:25:45,983 INFO L87 Difference]: Start difference. First operand 364 states and 457 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) [2024-11-09 03:25:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:25:46,029 INFO L93 Difference]: Finished difference Result 1053 states and 1332 transitions. [2024-11-09 03:25:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 03:25:46,030 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 [2024-11-09 03:25:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:25:46,033 INFO L225 Difference]: With dead ends: 1053 [2024-11-09 03:25:46,036 INFO L226 Difference]: Without dead ends: 699 [2024-11-09 03:25:46,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:25:46,038 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 230 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 03:25:46,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 556 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 03:25:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-09 03:25:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 692. [2024-11-09 03:25:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 553 states have (on average 1.2459312839059675) internal successors, (689), 556 states have internal predecessors, (689), 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) [2024-11-09 03:25:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 871 transitions. [2024-11-09 03:25:46,076 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 871 transitions. Word has length 18 [2024-11-09 03:25:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:25:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 871 transitions. [2024-11-09 03:25:46,077 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) [2024-11-09 03:25:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 871 transitions. [2024-11-09 03:25:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 03:25:46,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:25:46,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:25:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 03:25:46,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:25:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:25:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2050665313, now seen corresponding path program 1 times [2024-11-09 03:25:46,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:25:46,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003765960] [2024-11-09 03:25:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:25:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:25:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:25:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 03:25:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:25:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 03:25:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:47,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:25:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 03:25:47,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:25:47,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003765960] [2024-11-09 03:25:47,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003765960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:25:47,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:25:47,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 03:25:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119182242] [2024-11-09 03:25:47,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:25:47,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 03:25:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:25:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 03:25:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 03:25:47,291 INFO L87 Difference]: Start difference. First operand 692 states and 871 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 03:25:51,315 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 [] [2024-11-09 03:25:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:25:51,762 INFO L93 Difference]: Finished difference Result 1466 states and 1866 transitions. [2024-11-09 03:25:51,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 03:25:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 3 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 [2024-11-09 03:25:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:25:51,769 INFO L225 Difference]: With dead ends: 1466 [2024-11-09 03:25:51,769 INFO L226 Difference]: Without dead ends: 791 [2024-11-09 03:25:51,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 03:25:51,772 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 168 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 03:25:51,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 395 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 03:25:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-09 03:25:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 727. [2024-11-09 03:25:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 588 states have (on average 1.25) internal successors, (735), 591 states have internal predecessors, (735), 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) [2024-11-09 03:25:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 917 transitions. [2024-11-09 03:25:51,803 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 917 transitions. Word has length 51 [2024-11-09 03:25:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:25:51,803 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 917 transitions. [2024-11-09 03:25:51,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 03:25:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 917 transitions. [2024-11-09 03:25:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 03:25:51,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:25:51,806 INFO L215 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] [2024-11-09 03:25:51,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 03:25:51,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:25:51,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:25:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 873011692, now seen corresponding path program 1 times [2024-11-09 03:25:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:25:51,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549950787] [2024-11-09 03:25:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:25:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:25:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:25:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 03:25:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:25:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 03:25:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:25:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 03:25:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:25:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 03:25:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:25:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 03:25:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:25:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549950787] [2024-11-09 03:25:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549950787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:25:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:25:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 03:25:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548568605] [2024-11-09 03:25:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:25:53,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 03:25:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:25:53,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 03:25:53,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 03:25:53,299 INFO L87 Difference]: Start difference. First operand 727 states and 917 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 03:25:57,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:25:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:25:58,089 INFO L93 Difference]: Finished difference Result 1493 states and 1888 transitions. [2024-11-09 03:25:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 03:25:58,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2024-11-09 03:25:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:25:58,093 INFO L225 Difference]: With dead ends: 1493 [2024-11-09 03:25:58,094 INFO L226 Difference]: Without dead ends: 779 [2024-11-09 03:25:58,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 03:25:58,096 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 63 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 03:25:58,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1049 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 329 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 03:25:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-09 03:25:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 727. [2024-11-09 03:25:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 588 states have (on average 1.248299319727891) internal successors, (734), 591 states have internal predecessors, (734), 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) [2024-11-09 03:25:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 916 transitions. [2024-11-09 03:25:58,170 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 916 transitions. Word has length 90 [2024-11-09 03:25:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:25:58,170 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 916 transitions. [2024-11-09 03:25:58,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 03:25:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 916 transitions. [2024-11-09 03:25:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 03:25:58,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:25:58,175 INFO L215 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] [2024-11-09 03:25:58,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 03:25:58,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:25:58,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:25:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash -581652613, now seen corresponding path program 1 times [2024-11-09 03:25:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:25:58,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416954386] [2024-11-09 03:25:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:25:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:25:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:59,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:25:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:59,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:25:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:25:59,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:25:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 03:26:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 03:26:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 03:26:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 03:26:00,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416954386] [2024-11-09 03:26:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416954386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 03:26:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963507501] [2024-11-09 03:26:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:00,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 03:26:00,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 03:26:00,078 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) [2024-11-09 03:26:00,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 03:26:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:01,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 03:26:01,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 03:26:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 03:26:01,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 03:26:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963507501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 03:26:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-09 03:26:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199560944] [2024-11-09 03:26:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:01,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 03:26:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 03:26:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 03:26:01,519 INFO L87 Difference]: Start difference. First operand 727 states and 916 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 03:26:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:01,575 INFO L93 Difference]: Finished difference Result 1193 states and 1500 transitions. [2024-11-09 03:26:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 03:26:01,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2024-11-09 03:26:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:01,579 INFO L225 Difference]: With dead ends: 1193 [2024-11-09 03:26:01,579 INFO L226 Difference]: Without dead ends: 484 [2024-11-09 03:26:01,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 03:26:01,585 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:01,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 711 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 03:26:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-09 03:26:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2024-11-09 03:26:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 387 states have (on average 1.2325581395348837) internal successors, (477), 390 states have internal predecessors, (477), 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) [2024-11-09 03:26:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 599 transitions. [2024-11-09 03:26:01,673 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 599 transitions. Word has length 95 [2024-11-09 03:26:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:01,673 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 599 transitions. [2024-11-09 03:26:01,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 03:26:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 599 transitions. [2024-11-09 03:26:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 03:26:01,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:01,679 INFO L215 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] [2024-11-09 03:26:01,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 03:26:01,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 03:26:01,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:01,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 45648230, now seen corresponding path program 1 times [2024-11-09 03:26:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:01,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774614171] [2024-11-09 03:26:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:26:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:26:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 03:26:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 03:26:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 03:26:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 03:26:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 03:26:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774614171] [2024-11-09 03:26:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774614171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 03:26:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930757794] [2024-11-09 03:26:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:03,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 03:26:03,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 03:26:03,740 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) [2024-11-09 03:26:03,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 03:26:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:05,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 03:26:05,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 03:26:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 03:26:05,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 03:26:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930757794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 03:26:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2024-11-09 03:26:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684747860] [2024-11-09 03:26:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:05,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 03:26:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 03:26:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-09 03:26:05,505 INFO L87 Difference]: Start difference. First operand 484 states and 599 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) [2024-11-09 03:26:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:05,655 INFO L93 Difference]: Finished difference Result 986 states and 1231 transitions. [2024-11-09 03:26:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 03:26:05,655 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 [2024-11-09 03:26:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:05,658 INFO L225 Difference]: With dead ends: 986 [2024-11-09 03:26:05,658 INFO L226 Difference]: Without dead ends: 520 [2024-11-09 03:26:05,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-09 03:26:05,661 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 2 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:05,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2089 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 03:26:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-09 03:26:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 517. [2024-11-09 03:26:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 414 states have (on average 1.2246376811594204) internal successors, (507), 417 states have internal predecessors, (507), 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) [2024-11-09 03:26:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 644 transitions. [2024-11-09 03:26:05,701 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 644 transitions. Word has length 92 [2024-11-09 03:26:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:05,702 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 644 transitions. [2024-11-09 03:26:05,702 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) [2024-11-09 03:26:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 644 transitions. [2024-11-09 03:26:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 03:26:05,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:05,703 INFO L215 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] [2024-11-09 03:26:05,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 03:26:05,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 03:26:05,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:05,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1137699067, now seen corresponding path program 1 times [2024-11-09 03:26:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743565296] [2024-11-09 03:26:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:26:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:26:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 03:26:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 03:26:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 03:26:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 03:26:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 03:26:07,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:07,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743565296] [2024-11-09 03:26:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743565296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 03:26:07,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303545179] [2024-11-09 03:26:07,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 03:26:07,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 03:26:07,523 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) [2024-11-09 03:26:07,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 03:26:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:08,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 03:26:08,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 03:26:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 03:26:09,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 03:26:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 03:26:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303545179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 03:26:09,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 03:26:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 13 [2024-11-09 03:26:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594532557] [2024-11-09 03:26:09,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 03:26:09,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 03:26:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 03:26:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 03:26:09,455 INFO L87 Difference]: Start difference. First operand 517 states and 644 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 9 states have internal predecessors, (85), 5 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-09 03:26:13,470 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 [] [2024-11-09 03:26:17,489 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 [] [2024-11-09 03:26:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:19,527 INFO L93 Difference]: Finished difference Result 1109 states and 1398 transitions. [2024-11-09 03:26:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 03:26:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 9 states have internal predecessors, (85), 5 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 92 [2024-11-09 03:26:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:19,531 INFO L225 Difference]: With dead ends: 1109 [2024-11-09 03:26:19,534 INFO L226 Difference]: Without dead ends: 574 [2024-11-09 03:26:19,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-09 03:26:19,537 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 70 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:19,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 2023 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 751 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2024-11-09 03:26:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-09 03:26:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 532. [2024-11-09 03:26:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 426 states have (on average 1.2112676056338028) internal successors, (516), 426 states have internal predecessors, (516), 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) [2024-11-09 03:26:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 662 transitions. [2024-11-09 03:26:19,577 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 662 transitions. Word has length 92 [2024-11-09 03:26:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:19,579 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 662 transitions. [2024-11-09 03:26:19,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 9 states have internal predecessors, (85), 5 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-09 03:26:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 662 transitions. [2024-11-09 03:26:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 03:26:19,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:19,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-09 03:26:19,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 03:26:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 03:26:19,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:19,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:19,787 INFO L85 PathProgramCache]: Analyzing trace with hash 623518438, now seen corresponding path program 1 times [2024-11-09 03:26:19,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:19,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151121096] [2024-11-09 03:26:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:19,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:26:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:26:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 03:26:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 03:26:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 03:26:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 03:26:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 03:26:21,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151121096] [2024-11-09 03:26:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151121096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:21,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 03:26:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495696230] [2024-11-09 03:26:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 03:26:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:21,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 03:26:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 03:26:21,425 INFO L87 Difference]: Start difference. First operand 532 states and 662 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:26:25,447 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 [] [2024-11-09 03:26:29,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:26:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:30,683 INFO L93 Difference]: Finished difference Result 956 states and 1198 transitions. [2024-11-09 03:26:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 03:26:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2024-11-09 03:26:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:30,687 INFO L225 Difference]: With dead ends: 956 [2024-11-09 03:26:30,687 INFO L226 Difference]: Without dead ends: 556 [2024-11-09 03:26:30,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 03:26:30,688 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 59 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:30,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1348 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 425 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-09 03:26:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-09 03:26:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 547. [2024-11-09 03:26:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 438 states have (on average 1.2054794520547945) internal successors, (528), 435 states have internal predecessors, (528), 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) [2024-11-09 03:26:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 679 transitions. [2024-11-09 03:26:30,706 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 679 transitions. Word has length 96 [2024-11-09 03:26:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 679 transitions. [2024-11-09 03:26:30,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:26:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 679 transitions. [2024-11-09 03:26:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 03:26:30,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:30,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:26:30,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 03:26:30,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash 634834565, now seen corresponding path program 1 times [2024-11-09 03:26:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519905530] [2024-11-09 03:26:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:26:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:26:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 03:26:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 03:26:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 03:26:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 03:26:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 03:26:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519905530] [2024-11-09 03:26:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519905530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 03:26:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623200598] [2024-11-09 03:26:32,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:32,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 03:26:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 03:26:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 03:26:32,439 INFO L87 Difference]: Start difference. First operand 547 states and 679 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:26:36,454 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 [] [2024-11-09 03:26:40,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:26:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:41,425 INFO L93 Difference]: Finished difference Result 966 states and 1207 transitions. [2024-11-09 03:26:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 03:26:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2024-11-09 03:26:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:41,429 INFO L225 Difference]: With dead ends: 966 [2024-11-09 03:26:41,429 INFO L226 Difference]: Without dead ends: 556 [2024-11-09 03:26:41,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 03:26:41,430 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 114 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 51 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:41,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1535 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 556 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-09 03:26:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-09 03:26:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 547. [2024-11-09 03:26:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 438 states have (on average 1.2009132420091324) internal successors, (526), 435 states have internal predecessors, (526), 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) [2024-11-09 03:26:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 677 transitions. [2024-11-09 03:26:41,465 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 677 transitions. Word has length 96 [2024-11-09 03:26:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 677 transitions. [2024-11-09 03:26:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:26:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 677 transitions. [2024-11-09 03:26:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 03:26:41,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:41,467 INFO L215 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] [2024-11-09 03:26:41,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 03:26:41,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:41,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:41,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1600845766, now seen corresponding path program 1 times [2024-11-09 03:26:41,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:41,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256987047] [2024-11-09 03:26:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:26:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:26:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 03:26:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 03:26:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 03:26:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 03:26:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:42,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256987047] [2024-11-09 03:26:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256987047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 03:26:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154906934] [2024-11-09 03:26:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:42,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 03:26:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:42,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 03:26:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 03:26:42,614 INFO L87 Difference]: Start difference. First operand 547 states and 677 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 03:26:46,628 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 [] [2024-11-09 03:26:50,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:26:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:51,615 INFO L93 Difference]: Finished difference Result 977 states and 1216 transitions. [2024-11-09 03:26:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 03:26:51,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 99 [2024-11-09 03:26:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:51,621 INFO L225 Difference]: With dead ends: 977 [2024-11-09 03:26:51,621 INFO L226 Difference]: Without dead ends: 974 [2024-11-09 03:26:51,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 03:26:51,623 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 424 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:51,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 767 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 301 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-09 03:26:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-11-09 03:26:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 931. [2024-11-09 03:26:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 752 states have (on average 1.211436170212766) internal successors, (911), 745 states have internal predecessors, (911), 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) [2024-11-09 03:26:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1170 transitions. [2024-11-09 03:26:51,656 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1170 transitions. Word has length 99 [2024-11-09 03:26:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1170 transitions. [2024-11-09 03:26:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 03:26:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1170 transitions. [2024-11-09 03:26:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 03:26:51,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:51,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-09 03:26:51,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 03:26:51,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1173044150, now seen corresponding path program 1 times [2024-11-09 03:26:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:51,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875354478] [2024-11-09 03:26:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:26:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:26:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 03:26:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:26:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 03:26:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 03:26:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:26:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 03:26:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:26:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 03:26:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875354478] [2024-11-09 03:26:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875354478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:52,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:52,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 03:26:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225460987] [2024-11-09 03:26:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 03:26:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:52,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 03:26:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 03:26:52,798 INFO L87 Difference]: Start difference. First operand 931 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 03:26:56,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:27:00,834 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 [] [2024-11-09 03:27:04,853 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 [] [2024-11-09 03:27:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:27:05,450 INFO L93 Difference]: Finished difference Result 1868 states and 2350 transitions. [2024-11-09 03:27:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 03:27:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (12), 4 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 109 [2024-11-09 03:27:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:27:05,457 INFO L225 Difference]: With dead ends: 1868 [2024-11-09 03:27:05,458 INFO L226 Difference]: Without dead ends: 922 [2024-11-09 03:27:05,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 03:27:05,462 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 156 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-09 03:27:05,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 895 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 298 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2024-11-09 03:27:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-09 03:27:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 883. [2024-11-09 03:27:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 714 states have (on average 1.2058823529411764) internal successors, (861), 711 states have internal predecessors, (861), 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) [2024-11-09 03:27:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1113 transitions. [2024-11-09 03:27:05,490 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1113 transitions. Word has length 109 [2024-11-09 03:27:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:27:05,490 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1113 transitions. [2024-11-09 03:27:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 03:27:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1113 transitions. [2024-11-09 03:27:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 03:27:05,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:27:05,492 INFO L215 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] [2024-11-09 03:27:05,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 03:27:05,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:27:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:27:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 541116892, now seen corresponding path program 1 times [2024-11-09 03:27:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:27:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779499155] [2024-11-09 03:27:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:27:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:27:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:27:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 03:27:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:27:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:27:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 03:27:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 03:27:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 03:27:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:27:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 03:27:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:07,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:27:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 03:27:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 03:27:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 03:27:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 03:27:07,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:27:07,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779499155] [2024-11-09 03:27:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779499155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:27:07,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:27:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 03:27:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615713167] [2024-11-09 03:27:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:27:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 03:27:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:27:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 03:27:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 03:27:07,161 INFO L87 Difference]: Start difference. First operand 883 states and 1113 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12)